Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines

Authors:
Xiao Min;Jing Liu;Yuqing Wang
Affiliations:
College of Mathematics and Information Engineering, Jiaxing University, 314001, China;College of Mathematics and Information Engineering, Jiaxing University, 314001, China;College of Mathematics and Information Engineering, Jiaxing University, 314001, China
Venue:
Information Processing Letters
Year:
2011

Citing 7
Cited 2

Semi-online algorithms for parallel machine scheduling problems

Computing
Online scheduling on two uniform machines to minimize the makespan

Theoretical Computer Science
Online Scheduling with Bounded Migration

Mathematics of Operations Research
Online scheduling with reassignment on two uniform machines

Theoretical Computer Science
Online scheduling with rearrangement on two related machines

Theoretical Computer Science
Online scheduling with reassignment

Operations Research Letters
Semi-on-line problems on two identical machines with combined partial information

Operations Research Letters

Online scheduling with rejection and withdrawal

Theoretical Computer Science
On the value of job migration in online makespan minimization

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we consider semi-online minimum makespan scheduling problem with reassignment on two identical machines. Two versions are discussed. In the first version, one can reassign the last job of one machine that is based on the problem proposed by Tan and Yu (2008) [1], in which case the last job of each machine is allowed to be reassigned. An optimal algorithm which has the same competitive ratio 2 is presented. In the second version we consider the combination of the next two conditions: the total size of all jobs is known in advance and one can reassign the last job of one machine. For this problem an optimal algorithm with competitive ratio 54 is also given.