Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision

Authors:
Yong Wu;Qifan Yang
Affiliations:
Department of Fundamental Education, Ningbo Institute of Technology, Zhejiang University, Ningbo, PR China;Department of Mathematics, Zhejiang University, Hangzhou, PR China
Venue:
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Year:
2010

Citing 7
Cited 1

Semi on-line scheduling on two identical machines

Computing
On-line bin-stretching

Theoretical Computer Science
On-Line Load Balancing in a Hierarchical Server Topology

SIAM Journal on Computing
On-line algorithms for the channel assignment problem in cellular networks

Discrete Applied Mathematics
Online parallel machines scheduling with two hierarchies

Theoretical Computer Science
Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times

Journal of Combinatorial Optimization
Online and semi-online scheduling of two machines under a grade of service provision

Operations Research Letters

Semi-online hierarchical scheduling problems with buffer or rearrangements

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates semi-online scheduling problems on two parallel identical machines under a grade of service (GoS) provision. We consider two different semi-online versions where the optimal offline value of the instance is known in advance or the largest processing time of all jobs is known in advance. Respectively for two semi-online problems, we develop algorithms with competitive ratios of 3/2 and (√5 + 1)/2, which are shown to be optimal.