Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays

Mohamed Amine Mkadem (), Aziz Moukrim () and Mehdi Serairi ()
Additional contact information
Mohamed Amine Mkadem: Sorbonne universités, Université de Technologie de Compiégne, CNRS, UMR 7253 Heudiasyc
Aziz Moukrim: Sorbonne universités, Université de Technologie de Compiégne, CNRS, UMR 7253 Heudiasyc
Mehdi Serairi: Sorbonne universités, Université de Technologie de Compiégne, CNRS, UMR 7253 Heudiasyc

A chapter in Operations Research Proceedings 2016, 2018, pp 527-533 from Springer

Abstract: Abstract We consider the flow shop problem with two machines and time delays with respect to the makespan, i.e., the maximum completion time. We recall the lower bounds of the literature and we propose new relaxation schemes. Moreover, we investigate a linear programming-based lower bound that includes the implementation of a new dominance rule and a valid inequality. A computational study that was carried out on a set of 480 instances including new hard ones shows that our new relaxation schemes outperform the state of the art lower bounds.

Keywords: Flow Shop; Lower Bound; Valid Inequalities; Dominance Rule; Total Idle Time (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:oprchp:978-3-319-55702-1_70

Ordering information: This item can be ordered from
http://www.springer.com/9783319557021

DOI: 10.1007/978-3-319-55702-1_70

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().