Sign in
Back
A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
Journal article   Peer reviewed

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
Operational research, Vol.20(1), pp.21-35
01/03/2020
DOI: https://doi.org/10.1007/s12351-017-0308-7

Abstract

Operations Research & Management Science Science & Technology Technology
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.

Metrics

1 Record Views

Details