Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem (Q2273695): Difference between revisions

The authors address the problem of minimizing the maximum completion time on unrelated parallel machines with one renewable resource. A number of fast heuristic algorithms is presented. For tests, the authors use the instances generated in [\textit{L. Fanjul-Peyro} et al., Eur. J. Oper. Res. 260, No. 2, 482--493 (2017; Zbl 1403.90320)]. All instances are divided into small, medium and large. In large instances, the number of jobs is in \(\{ 50, 150, 250, 350 \}\), and the number of machines is in \(\{ 10, 20, 30 \}\). To estimate the effectiveness of the developed heuristics, the obtained feasible solution is compared with the best known feasible solution. The authors also count the number of instances that are solved optimally. Finally, the authors propose two fast heuristics that can be used for the considered problem.