Cite
HARVARD Citation
Fernandez-Viagas, V. et al. (2019). A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective. Computers & operations research. 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.
Fernandez-Viagas, V. et al. (2019). A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective. Computers & operations research. p. . [Online].