Article ID Journal Published Year Pages File Type
1142923 Operations Research Letters 2008 4 Pages PDF
Abstract
We study the on-line scheduling on an unbounded batch machine to minimize makespan. In this model, jobs arrive over time and batches are allowed limited restarts. Any batch that contains a job which has already been restarted once cannot be restarted any more. We provide a best possible on-line algorithm for the problem with a competitive ratio 32.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On-line scheduling on a batch machine to minimize makespan with limited restarts
Authors
, , , ,