Cite
HARVARD Citation
Nagano, M. et al. (2021). An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering optimization. 53 (8), pp. 1431-1449. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Nagano, M. et al. (2021). An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering optimization. 53 (8), pp. 1431-1449. [Online].