A two-machine no-wait flow shop problem with two competing agents

Abdennour Azerine (), Mourad Boudhar () and Djamal Rebaine ()
Additional contact information
Abdennour Azerine: Université des Sciences et de la Technologie Houari Boumedienne
Mourad Boudhar: Université des Sciences et de la Technologie Houari Boumedienne
Djamal Rebaine: Université du Québec à Chicoutimi

Journal of Combinatorial Optimization, 2022, vol. 43, issue 1, No 9, 168-199

Abstract: Abstract In this paper, we study the two-machine no-wait flow shop scheduling problem with two competing agents. The objective is to minimize the overall completion time of one agent subject to an upper bound on the makespan of the second agent. We proved the $$\mathcal {NP}$$ NP -hardness for three special cases: (1) each agent has exactly two operations. (2) the jobs of one agent require processing only on one machine, (3) the no-wait constraint is only required for the jobs of one agent. We exhibited polynomial time algorithms for other restricted cases. We also proposed a mathematical programming model and a branch and bound scheme as solving approaches for small-scale problems. For large instances, we present a tabu search meta-heuristic algorithm. An intensive experimental study is conducted to illustrate the effectiveness of the proposed exact and approximation algorithms.

Keywords: Multi-agent; No-wait in process; Complexity; Flowshop scheduling; Makespan (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00755-9 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:1:d:10.1007_s10878-021-00755-9

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

DOI: 10.1007/s10878-021-00755-9

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