Solving the two-machine open shop problem with a single server with respect to the makespan

Nadia Babou (), Djamal Rebaine () and Mourad Boudhar ()
Additional contact information
Nadia Babou: Université Mouloud Mammeri de Tizi-Ouzou
Djamal Rebaine: Université du Québec à Chicoutimi
Mourad Boudhar: Université des Sciences et de la Technologie Houari Boumédiène

Annals of Operations Research, 2024, vol. 338, issue 2, No 2, 857-877

Abstract: Abstract We address in this paper the two-machine open shop problem with a single server to prepare jobs before going through the processing so as to minimize the makespan. The server is only needed during the preparation phase before becoming available again, leaving the prepared job to complete its processing. We present three lower bounds with respect to the makespan. In addition, we show the $$\mathcal{N}\mathcal{P}$$ N P -completeness of two restricted cases. Then, we present a well solvable case. Finally, we develop two mixed integer linear programming (MILP) models for the general problem along with an experimental study we conducted to analyze their performance.

Keywords: Open shop; Set-up times; Server; Makespan; Complexity; MILP (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-024-06097-z 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:338:y:2024:i:2:d:10.1007_s10479-024-06097-z

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

DOI: 10.1007/s10479-024-06097-z

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