Jia, Zhao-hong; Leung, Joseph Y.-T. - In: European Journal of Operational Research 240 (2015) 3, pp. 649-665
We consider the problem of scheduling a set of n jobs with arbitrary job sizes on a set of m identical and parallel batch machines so as to minimize the makespan. Motivated by the computational complexity of the problem, we propose a meta-heuristic based on the max–min ant system method....