Efficient algorithms for scheduling semiconductor burn-in operations
Operations Research
Online computation and competitive analysis
Online computation and competitive analysis
Online scheduling in a parallel batch processing system to minimize makespan using restarts
Theoretical Computer Science
On-line scheduling on a batch machine to minimize makespan with limited restarts
Operations Research Letters
| Hi-index | 0.00 |
We consider two semi-online scheduling problems on a single batch (processing) machine with jobs' nondecreasing processing times and jobs' nonincreasing processing times, respectively. Our objective is to minimize the makespan. A batch processing machine can handle up to B jobs simultaneously. We study an unbounded model where B = ***. The jobs that are processed together construct a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. Jobs arrive over time. Let p j denote the processing time of job J j . Given job J j and its following job J j + 1 , we assume that p j + 1 *** ***p j , where *** *** 1 is a constant number, for the first problem with jobs' nondecreasing processing times. For the second problem, we assume that p j + 1 ≤ ***p j , where 0 ***