Batching and scheduling jobs on batch and discrete processors
Operations Research
Efficient algorithms for scheduling semiconductor burn-in operations
Operations Research
Minimizing Makespan in Batch Machine Scheduling
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Minimizing makespan on a single batching machine with release times and non-identical job sizes
Operations Research Letters
| Hi-index | 0.00 |
We study the scheduling of a set of jobs, each characterised by a release (arrival) time and a processing time, for a batch processing machine capable of running (at most) a fixed number of jobs at a time. When the job release times and processing times are known a-priori and the inputs are integers, we obtained an algorithm for finding a schedule with the minimum makespan. The running time is pseudopolynomial when the number of distinct job release times is constant. We also obtained a fully polynomial time approximation scheme when the number of distinct job release times is constant, and a polynomial time approximation scheme when that number is arbitrary. When nothing is known about a job until it arrives, i.e., the on-line setting, we proved a lower bound of (√5 + 1)/2 on the competitive ratio of any approximation algorithm. This bound is tight when the machine capacity is unbounded.