Archivio Istituzionale della RicercaWe consider the two machine total completion time flow shop scheduling problem. This problem is known to be NP-Hard in the strong sense. An improved Lagrangean relaxation approach is proposed. Two new dominance criteria are introduced to curtail the enumeration tree. A branch-and-bound algorithm capable of solving to optimality medium size problem instances is presented.
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem / DELLA CROCE DI DOJOLA, Federico; Ghirardi, Marco; Tadei, Roberto. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - 139:2(2002), pp. 293-301. [10.1016/S0377-2217(01)00374-5]
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
DELLA CROCE DI DOJOLA, Federico;GHIRARDI, MARCO;TADEI, Roberto
2002
Abstract
We consider the two machine total completion time flow shop scheduling problem. This problem is known to be NP-Hard in the strong sense. An improved Lagrangean relaxation approach is proposed. Two new dominance criteria are introduced to curtail the enumeration tree. A branch-and-bound algorithm capable of solving to optimality medium size problem instances is presented.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1399390
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo