| Article ID: | iaor20091011 |
| Country: | Netherlands |
| Volume: | 36 |
| Issue: | 2 |
| Start Page Number: | 255 |
| End Page Number: | 258 |
| Publication Date: | Mar 2008 |
| Journal: | Operations Research Letters |
| Authors: | Yuan Jinjiang, Fu Ruyan, Tian Ji, He Cheng |
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 online algorithm for the problem with a competitive ratio 3/2.