Abstract
Scheduling with arbitrary due dates and no idle time permitted between jobs with the objective of minimizing the total earliness and tardiness has a variety of industry applications. We review mathematical programming formulations for single and parallel machine problems with fixed and controllable processing and setup times. Weaknesses of the formulations are identified, corrections and/or improvements are provided, and further research directions are suggested.
Original language | American English |
---|---|
Journal | Omega |
Volume | 103 |
DOIs | |
State | Published - Sep 2021 |
Keywords
- Arbitrary due dates
- Controllable processing times
- Earliness and tardiness
- Scheduling with no idle time
Disciplines
- Economics