A branch and bound procedure for the reentrant permutation flow-shop scheduling problem
2005 ◽
Vol 29
(11-12)
◽
pp. 1186-1193
◽
2020 ◽
Vol 284
(3)
◽
pp. 814-833
◽
2014 ◽
Vol 77
◽
pp. 35-47
◽
2013 ◽
Vol 10
(3)
◽
pp. 708-713
◽
2021 ◽
Vol 18
(4)
◽
pp. 545
2021 ◽
Vol 2010
(1)
◽
pp. 012018