Efficient algorithms for scheduling semiconductor burn-in operations
Operations Research
Scheduling one batch processor subject to job release dates
Discrete Applied Mathematics
Note: A best online algorithm for scheduling on two parallel batch machines
Theoretical Computer Science
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
Operations Research Letters
Minimizing makespan on a single batching machine with release times and non-identical job sizes
Operations Research Letters
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
Information Processing Letters
Online scheduling on unbounded parallel-batch machines with incompatible job families
Theoretical Computer Science
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
Information Processing Letters
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
Information Processing Letters
Theoretical Computer Science
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
Information Processing Letters
| Hi-index | 0.00 |
We study on-line scheduling on parallel batch machines. Jobs arrive over time. A batch processing machine can handle up to B jobs simultaneously. The jobs that are processed together form a batch and all jobs in a batch start and are completed at the same time. The processing time of a batch is given by the processing time of the longest job in the batch. The objective is to minimize the makespan. We deal with the unbounded model, where B is sufficiently large. We first show that no deterministic on-line algorithm can have a competitive ratio of less than $1+(\sqrt{m^{2}+4}-m)/2$ , where m is the number of parallel batch machines. We then present an on-line algorithm which is the one best possible for any specific values of m.