Abstract
We consider a single-machine due window assignment and scheduling problem with batch deliveries, where all jobs have a common due window, and the start time and size of the due window are decision variables. Finished jobs are delivered in batches with unlimited batch capacity. The objective is to determine the due window, a job sequence, and the delivery times, so as to minimize the total cost which comprises earliness of delivery, job holding, start time of due window, size of due window, number of delivery batches, and tardiness penalty. We consider three different variants of the problem corresponding to different measurements of tardiness penalty. We present polynomial-time solution procedures for these variants with significantly lower computational complexities than those of known algorithms in the literature. © 2015 Elsevier B.V.
| Original language | English |
|---|---|
| Pages (from-to) | 30-39 |
| Journal | Theoretical Computer Science |
| Volume | 570 |
| Issue number | C |
| DOIs | |
| Publication status | Published - 2015 |
| 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].Research Keywords
- Batch delivery
- Computational complexity
- Due window
- Scheduling
Fingerprint
Dive into the research topics of 'Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver