Cite
HARVARD Citation
Chen, S. et al. (2021). A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem. Engineering applications of artificial intelligence. 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.
Chen, S. et al. (2021). A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem. Engineering applications of artificial intelligence. p. . [Online].