Abstract
We consider an integrated scheduling and distribution model in which jobs completed by two different machines must be bundled together for delivery. The objective is to minimize the sum of the delivery cost and customers' waiting costs. Such a model not only attempts to coordinate the job schedules on both machines, but also aims to coordinate the machine schedules with the delivery plan. Polynomial-time heuristics and approximation schemes are developed for the model with only direct shipments as well as the general model with milk-run deliveries.
| Original language | English |
|---|---|
| Pages (from-to) | 203-215 |
| Journal | IIE Transactions (Institute of Industrial Engineers) |
| Volume | 39 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Feb 2007 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Funding
The authors would like thank the Associate Editor and two referees for their helpful comments and suggestions. This research was supported in part by the Research Grants Council of Hong Kong under grant PolyU6132/02E. Part of George Vairaktarakis' work was performed at the Department of Logistics at The Hong Kong Polytechnic University.
Research Keywords
- Bundling operations
- Coordination
- Distribution
- Polynomial-time approximation schemes
- Scheduling
RGC Funding Information
- RGC-funded