مرکز منطقه ای اطلاع رساني علوم و فناوري - An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

Title of article :

An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

Author/Authors :

F. Della Croce، نويسنده , , M. Ghirardi، نويسنده , , R. Tadei، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2002

Pages :

From page :

293

To page :

301

Keywords :

Branch-and-bound , Flow shop scheduling , Lagrangean relaxation

Journal title :

European Journal of Operational Research

Serial Year :

2002

Journal title :

European Journal of Operational Research

Record number :

214091

Link To Document :