Two-machine permutation flow shop scheduling with generalized due dates to minimize total late work

Byung-Cheon Choi (), Myoung-Ju Park () and Kyung Min Kim ()
Additional contact information
Byung-Cheon Choi: Chungnam National University
Myoung-Ju Park: Seoul National University
Kyung Min Kim: Myongji University

Journal of Scheduling, 2025, vol. 28, issue 6, No 1, 563-576

Abstract: Abstract We consider a two-machine permutation flow shop scheduling problem with generalized due dates to minimize total late work. Note that in our problem, a due date is given based on a specific position instead of a specific job. First, we analyze how the computational complexity varies depending on the structure of the processing times. Then, we present a mixed-integer programming model, two heuristics, and a branch-and-bound algorithm. Finally, we conduct numerical experiments and recommend which solution approach should be applied in which case.

Keywords: Scheduling; Generalized due dates; Late work; Computational complexity (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-025-00834-3 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:jsched:v:28:y:2025:i:6:d:10.1007_s10951-025-00834-3

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

DOI: 10.1007/s10951-025-00834-3

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

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