A PTAS for non-resumable open shop scheduling with an availability constraint

Yuan Yuan (), Yan Lan (), Ning Ding () and Xin Han ()
Additional contact information
Yuan Yuan: Dalian University of Technology
Yan Lan: Dalian Minzu University
Xin Han: Dalian University of Technology

Journal of Combinatorial Optimization, 2022, vol. 43, issue 2, No 3, 350-362

Abstract: Abstract Shop scheduling problem is one of the most classical problems in combinatorial optimization. In this paper, we study two-machine open shop scheduling problem, provided that one machine is subject to maintenance period which has to be performed in a fixed time interval. The target is to minimize the makespan. This paper considers non-resumable scenario, i.e., if a job which starts before the maintenance period cannot be completed before the maintenance period, then it must be restarted after the interval from scratch. We only discuss the case that the maintenance period is performed on the first machine, while the case of the maintenance period on the second machine is symmetric. We obtain a polynomial time approximation scheme, which is better than the best previous result $$\frac{4}{3}$$ 4 3 .

Keywords: Open shop scheduling; Machine non-availability; Approximation algorithm; Polynomial time approximation scheme (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00773-7 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:43:y:2022:i:2:d:10.1007_s10878-021-00773-7

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

DOI: 10.1007/s10878-021-00773-7

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