Automatic generation of iterated greedy algorithms for the non-permutation flow shop scheduling problem with total completion time minimization
2019 ◽
Vol 71
(11)
◽
pp. 1847-1859
◽
2015 ◽
Vol 54
◽
pp. 155-167
◽
2020 ◽
Vol 39
(4)
◽
pp. 562
2006 ◽
Vol 182
(1)
◽
pp. 947-954
◽
2021 ◽
Vol 14
(6)
◽
pp. 464-475
2020 ◽
Vol 39
(4)
◽
pp. 562
2010 ◽
Vol 53
(9-12)
◽
pp. 1189-1197
◽