Minmax due-date assignment on a two-machine flowshop

Baruch Mor () and Gur Mosheiov
Additional contact information
Baruch Mor: Ariel University
Gur Mosheiov: The Hebrew University

Annals of Operations Research, 2021, vol. 305, issue 1, No 8, 209 pages

Abstract: 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.

Keywords: Scheduling; Two-machine flowshop; Due-date assignment; Minmax (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-021-04212-y 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:305:y:2021:i:1:d:10.1007_s10479-021-04212-y

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

DOI: 10.1007/s10479-021-04212-y

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 ().