Cite
HARVARD Citation
Brum, A. et al. (2022). Automatic generation of iterated greedy algorithms for the non-permutation flow shop scheduling problem with total completion time minimization. Computers & industrial engineering. p. . [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Brum, A. et al. (2022). Automatic generation of iterated greedy algorithms for the non-permutation flow shop scheduling problem with total completion time minimization. Computers & industrial engineering. p. . [Online].