A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
2006 ◽
Vol 174
(1)
◽
pp. 1-10
◽
2015 ◽
Vol 23
(4)
◽
pp. 387
◽
1992 ◽
Vol 39
(2)
◽
pp. 265-283
◽
1997 ◽
Vol 96
(3)
◽
pp. 578-590
◽
2019 ◽
Vol 13
(4)
◽
pp. JAMDSM0080-JAMDSM0080
Keyword(s):
2017 ◽
Vol 30
(4)
◽
pp. 441
◽
2016 ◽
Vol 33
(6)
◽
pp. 426-434
◽
2006 ◽
Vol 183
(1)
◽
pp. 575-588
◽