A Bottleneck-Assignment Based Branch-and-Bound Algorithm to Minimize the Makespan in an m-Machine Permutation Flowshop
1997 ◽
Vol 96
(3)
◽
pp. 578-590
◽
2006 ◽
Vol 174
(1)
◽
pp. 1-10
◽
2015 ◽
Vol 23
(4)
◽
pp. 387
◽
2002 ◽
Vol 79
(3)
◽
pp. 185-196
◽
Keyword(s):
Keyword(s):