The minmax due-date assignment problem with acceptable lead-times

Gur Mosheiov and Assaf Sarig ()
Additional contact information
Gur Mosheiov: The Hebrew University
Assaf Sarig: The Hebrew University

Annals of Operations Research, 2024, vol. 343, issue 1, No 14, 410 pages

Abstract: Abstract We study a single machine scheduling and due-date assignment problem with acceptable lead-times. The setting combines elements of the classical common due-date model and the DIF model, where job-dependent due-dates need to be determined. The objective function, which is of a minmax type, consists of four cost components: (1) job-earliness cost, (2) job-tardiness cost, (3) due-date cost, (4) due-date tardiness cost. We present a simple procedure for identifying the different job-types, and consequently, a polynomial-time solution is introduced. The case of due-windows for acceptable lead-times is also discussed.

Keywords: Scheduling; Single machine; Due-date assignment; Earliness-tardiness; Acceptable lead-time (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-024-06290-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:annopr:v:343:y:2024:i:1:d:10.1007_s10479-024-06290-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-024-06290-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().