مرکز منطقه ای اطلاع رساني علوم و فناوري - A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times

Title of article :

A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times

Author/Authors :

Ali Allahverdi، نويسنده , , Fawaz S. Al-Anzi، نويسنده ,

Issue Information :

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

Pages :

From page :

767

To page :

780

Keywords :

Dominance relation , Lower and upper bounds , Branch-and-bound , Scheduling , Distributed database , Flowshop , Total completion time

Journal title :

European Journal of Operational Research

Serial Year :

2006

Journal title :

European Journal of Operational Research

Record number :

215757

Link To Document :