The equal allocation policy in open shop batch scheduling

We study the optimality of the very practical policy of equal allocation of jobs to batches in batch scheduling problems on an m‐machine open shop. The objective is minimum makespan. We assume unit processing time jobs, machine‐dependent setup times and batch availability. We show that equal allocation is optimal for a two‐machine and a three‐machine open shop. Although, this policy is not necessarily optimal for larger size open shops, it is shown numerically to produce very close‐to‐optimal schedules.