A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
MA Rakrouki, A Kooli, S Chalghoumi, T Ladhari - Operational Research, 2020 - Springer
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 …
permutation flowshop problem subject to release dates. We derive several lower bounds as …