Title of article :
The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm
Author/Authors :
Can Akkan، نويسنده , , Selcuk Karabati، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
Keywords :
Branch-and-bound , Lagrangean relaxation , flowshop scheduling
Journal title :
European Journal of Operational Research
Journal title :
European Journal of Operational Research
