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

Gur Mosheiov, Assaf Sarig*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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.

Original languageEnglish
Pages (from-to)401-410
Number of pages10
JournalAnnals of Operations Research
Volume343
Issue number1
DOIs
StatePublished - Dec 2024

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

Keywords

  • Acceptable lead-time
  • Due-date assignment
  • Earliness-tardiness
  • Scheduling
  • Single machine

Fingerprint

Dive into the research topics of 'The minmax due-date assignment problem with acceptable lead-times'. Together they form a unique fingerprint.

Cite this