Abstract
We investigate the integrated production and distribution scheduling problem in a supply chain. The manufacturer’s production environment is modeled as a parallel machine system. A single capacitated vehicle is employed to deliver products in batches to multiple customers. The scheduling problem can also be viewed as either parallel machines with delivery considerations or a flexible flowshop. Different inventory holding costs, job sizes (volume or storage space required in the transportation unit), and job priorities are taken into account. Efficient mathematical modeling and near-optimal heuristic approaches are presented for minimizing total weighted completion time.
Original language | English (US) |
---|---|
Pages (from-to) | 511-537 |
Number of pages | 27 |
Journal | Journal of Heuristics |
Volume | 20 |
Issue number | 5 |
DOIs | |
State | Published - Oct 2014 |
Keywords
- Greedy heuristics
- Local search
- Mathematical modeling
- Supply chain scheduling
ASJC Scopus subject areas
- Software
- Information Systems
- Computer Networks and Communications
- Control and Optimization
- Management Science and Operations Research
- Artificial Intelligence