Minmax due-date assignment on a two-machine flowshop

Baruch Mor*, Gur Mosheiov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

We extend two classical scheduling and due-date assignment models. In the first (known in the literature as DIF), due-dates are determined by penalties for exceeding pre-specified deadlines. In the second (known as SLK), due-dates are assigned to jobs as a (linear) function of their processing times. We focus on the minmax versions of these models, and extend the single machine versions to a two-machine flowshop. We further extend the settings to that of a due-window. All the problems studied in this note are shown to have polynomial time solutions.

Original languageAmerican English
Pages (from-to)191-209
Number of pages19
JournalAnnals of Operations Research
Volume305
Issue number1-2
DOIs
StatePublished - Oct 2021

Bibliographical note

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

Keywords

  • Due-date assignment
  • Minmax
  • Scheduling
  • Two-machine flowshop

Fingerprint

Dive into the research topics of 'Minmax due-date assignment on a two-machine flowshop'. Together they form a unique fingerprint.

Cite this