Cite
HARVARD Citation
Kim, J. et al. (2017). Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups. Engineering optimization. 49 (10), pp. 1719-1732. [Online].