Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 646-652 |
| Number of pages | 7 |
| Journal | Journal of the Operational Research Society |
| Volume | 63 |
| Issue number | 5 |
| DOIs | |
| State | Published - May 2012 |
Keywords
- batch scheduling
- makespan
- open shop