Minimizing the makespan on parallel batch scheduling with stochastic times

Resumen

This paper addresses to the problem of batch scheduling in a parallel machine environment with size dependent setup time and release time and minimizing the makespan (Cmax). The jobs’ processing times, setup times and release times are stochastic for better depiction of the real world. The problem is NP-hard. Therefore, in this paper we compare different heuristics with a special simulation approach and analyze the obtained results.