Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension

Bahram Alidaee, Haitao Li, Haibo Wang, Keith Womer

Research output: Contribution to journalArticlepeer-review

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 languageAmerican English
JournalOmega
Volume103
DOIs
StatePublished - Sep 2021

Keywords

  • Arbitrary due dates
  • Controllable processing times
  • Earliness and tardiness
  • Scheduling with no idle time

Disciplines

  • Economics

Cite this