Two-machine flow shop scheduling with an operator non-availability period to minimize makespan

Dawei Li () and Xiwen Lu ()
Additional contact information
Dawei Li: East China University of Science and Technology
Xiwen Lu: East China University of Science and Technology

Journal of Combinatorial Optimization, 2020, vol. 39, issue 4, No 6, 1060-1078

Abstract: Abstract In this paper, we consider the two-machine flow shop scheduling with an operator non-availability period in the first stage to minimize makespan, where the operator non-availability period is an open time interval in which a job can neither start nor complete. We first prove that the problem is NP-hard, even if the length of the operator non-availability period is no more than the processing time of any job on the first machine. Then we show that Johnson’s rule is a 2-approximation algorithm and the bound is tight. Moreover, a better tight 3/2-approximation algorithm is provided.

Keywords: Flow shop scheduling; Operator non-availability; Approximation algorithm; Worst-case analysis (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00548-6 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:jcomop:v:39:y:2020:i:4:d:10.1007_s10878-020-00548-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00548-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

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