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 and Norman Womer

Omega, 2021, vol. 103, issue C

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.

Keywords: Scheduling with no idle time; Arbitrary due dates; Earliness and tardiness; Controllable processing times (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048321000554
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:103:y:2021:i:c:s0305048321000554

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.omega.2021.102446

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().