Approximating the 2-machine flow shop problem with exact delays taking two values

Alexander Ageev ()
Additional contact information
Alexander Ageev: Sobolev Institute of Mathematics

Journal of Global Optimization, 2020, vol. 76, issue 3, No 4, 497 pages

Abstract: Abstract In the 2-Machine Flow Shop problem with exact delays the operations of each job are separated by a given time lag (delay). Leung et al. (Int J Found Comput Sci 18:341–359, 2007) established that the problem is strongly NP-hard when the delays may have at most two different values. We present further results for this case: we prove that the existence of $$(1.25-\varepsilon )$$(1.25-ε)-approximation implies $$\hbox {P}=\hbox {NP}$$P=NP and develop a 2-approximation algorithm.

Keywords: Scheduling problem; Flow shop; Exact delays; Approximation algorithm; Inapproximability lower bound; Approximation factor (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/s10898-019-00775-0 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:jglopt:v:76:y:2020:i:3:d:10.1007_s10898-019-00775-0

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-019-00775-0

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

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