| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428988 | Information Processing Letters | 2012 | 5 Pages |
We study the classical batch scheduling problem with identical job processing times and identical setups on parallel identical machines. We show that, similar to the single machine case, the solution is given by a closed form, consisting of identical decreasing arithmetic sequences of batch sizes on the different machines. A very close-to-optimal integer solution is obtained in O(m+n) time, where m is the number of machines, and n is the number of jobs.
► We study batch scheduling problem with identical jobs and identical setup times. ► Parallel identical machines are assumed. ► An optimal schedule consists of identical arithmetic sequences on the different machines. ► An efficient rounding procedure leads to a very close-to-optimal integer solution.
