In this paper a branch and bound algorithm is presented for solving blocking flowshop scheduling problem. We consider the total completion time and total weighted completion time as objective function. Our proposed algorithm is the first one that addressed to these criteria. Besides, new machine based lower bounds are derived. Computational experiments show the effectiveness of the branch and bound algorithm to solve large scale instances.
Solving blocking flowshop scheduling problem with branch and bound algorithm
01.05.2013
953828 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Scheduling for flowshop problem
British Library Online Contents | 1995
|A branch and bound algorithm for the multiple depot vehicle scheduling problem
Tema Archiv | 1989
|A branch and bound solution method for the crane scheduling problem
Elsevier | 1989
|