Flow shop scheduling problem with conflict graphs

Nour El Houda Tellache () and Mourad Boudhar ()
Additional contact information
Nour El Houda Tellache: USTHB University
Mourad Boudhar: USTHB University

Annals of Operations Research, 2018, vol. 261, issue 1, No 15, 339-363

Abstract: Abstract This paper addresses the problem of scheduling jobs on flow shops subject to constraints given by an undirected graph, in which each edge joins a pair of conflicting jobs that cannot be processed simultaneously on different machines. We first show that the problem of minimizing the maximum completion time (makespan) is NP-hard for several versions. Then, we present polynomial-time solvable cases. On the other hand, we propose heuristic approaches and lower bounds alongside with an experimental study.

Keywords: Scheduling; Flow-shop; Conflict graph; Complexity; Heuristics (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2560-x 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:261:y:2018:i:1:d:10.1007_s10479-017-2560-x

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

DOI: 10.1007/s10479-017-2560-x

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