Exact method for the two-machine flow-shop problem with time delays

Mohamed Amine Mkadem (), Aziz Moukrim () and Mehdi Serairi ()
Additional contact information
Mohamed Amine Mkadem: Université de technologie de Compiègne - CS 60319
Aziz Moukrim: Université de technologie de Compiègne - CS 60319
Mehdi Serairi: Université de technologie de Compiègne - CS 60319

Annals of Operations Research, 2021, vol. 298, issue 1, No 19, 375-406

Abstract: Abstract We address the two-machine flow-shop scheduling problem with time delays in order to minimize the makespan, i.e., the maximum completion time. We present a comprehensive theoretical analysis of the different lower bounds of the state of the art and we elucidate dominance relationships between them. We then introduce an exact method based on a branch-and-bound scheme. This method includes a local search-based heuristic and three dominance rules. Finally, a computer simulation of the branch-and-bound method is given on a set of 480 instances. We point out the good performance of our branch-and-bound method that outperforms the state of the art exact method. Precisely, we manage to solve all the state of the art instances except one in a very short time.

Keywords: Two-machine flow-shop; Time delay; Makespan; Lower bound; Branch-and-bound (search for similar items in EconPapers)
Date: 2021
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/s10479-018-3082-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:298:y:2021:i:1:d:10.1007_s10479-018-3082-x

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

DOI: 10.1007/s10479-018-3082-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 ().