On-line scheduling on a batch machine to minimize makespan with limited restarts

Authors:
Ruyan Fu;Ji Tian;Jinjiang Yuan;Cheng He
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, China;Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, China and Institution of Science, Information Engineering University of PLA, Zhengzhou, Henan 450051, China
Venue:
Operations Research Letters
Year:
2008

Citing 2
Cited 4

Online scheduling in a parallel batch processing system to minimize makespan using restarts

Theoretical Computer Science
Minimizing the total completion time on-line on a single machine, using restarts

Journal of Algorithms

On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs

Journal of Scheduling
Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan

Information Processing Letters
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

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.