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

Authors:
Jinjiang Yuan;Ruyan Fu;C. T. Ng;T. C. Cheng
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, People's Republic of China 450001;School of Sciences, China University of Mining and Technology, Xuzhou, People's Republic of China 221116;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong
Venue:
Journal of Scheduling
Year:
2011

Citing 5
Cited 2

Lower bounds for on-line single-machine scheduling

Theoretical Computer Science
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 a batch machine to minimize makespan with limited restarts

Operations Research Letters
On-line scheduling on a single machine: maximizing the number of early jobs

Operations Research Letters

Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan

Information Processing Letters
Best semi-online algorithms for unbounded parallel batch scheduling

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider online scheduling with restarts in an unbounded parallel-batch processing system to minimize the makespan. By online we mean that jobs arrive over time and all the information on a job is unknown before its arrival time (release date) and restart means that a running batch may be interrupted, losing all the work done on it, and the jobs in the interrupted batch are released and become independently unscheduled jobs. It is known in the literature that the considered problem has no online algorithm with a competitive ratio less than $(5-\sqrt{5})/2$ . We give an online algorithm for the considered problem with a competitive ratio $(5-\sqrt{5})/2\approx 1.382$ .