A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates

Mohamed Ali Rakrouki, Anis Kooli (), Sabrine Chalghoumi and Talel Ladhari
Additional contact information
Mohamed Ali Rakrouki: Taibah University
Anis Kooli: Université de Tunis
Sabrine Chalghoumi: Université de Tunis
Talel Ladhari: Université de Tunis

Operational Research, 2020, vol. 20, issue 1, No 2, 35 pages

Abstract: Abstract We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop problem subject to release dates. We derive several lower bounds as well as a branch-and-bound algorithm for the problem under consideration. Computational experiments, on a large set of randomly generated instances, provide evidence that the proposed procedure performs consistently well.

Keywords: Flowshop; Release dates; Total completion time; Branch-and-bound (search for similar items in EconPapers)
Date: 2020
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/s12351-017-0308-7 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:operea:v:20:y:2020:i:1:d:10.1007_s12351-017-0308-7

Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351

DOI: 10.1007/s12351-017-0308-7

Access Statistics for this article

Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis

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