Semi-online scheduling jobs with tightly-grouped processing times on three identical machines

Authors:
Yong He;György Dósa
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou 310027, PR China and State Key Lab of CAD & CG, Zhejiang University, Hangzhou 310027, PR China;Department of Mathematics, University of Veszprém, Hungary
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 14
Cited 2

On the performance of on-line algorithms for partition problems

Acta Cybernetica
New algorithms for an ancient scheduling problem

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
A better algorithm for an ancient scheduling problem

Journal of Algorithms
Semi on-line scheduling on two identical machines

Computing
Better Bounds for Online Scheduling

SIAM Journal on Computing
On-line bin-stretching

Theoretical Computer Science
On randomized online scheduling

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Semi on-line algorithms for the partition problem

Operations Research Letters
Ordinal algorithms for parallel machine scheduling

Operations Research Letters
Semi-online scheduling with decreasing job sizes

Operations Research Letters
Semi-on-line scheduling with ordinal data on two uniform machines

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

Operations Research Letters

An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time

Information Processing Letters
Semi-online problems on identical machines with inexact partial information

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.04

Visualization

Abstract

This paper investigates the semi-online version of scheduling problem P||C"m"a"x on a three-machine system. We assume that all jobs have their processing times between p and rp (p0,r=1). We give a comprehensive competitive ratio of LS algorithm which is a piecewise function on r=1. It shows that LS is an optimal semi-online algorithm for every r@?[1,1.5], [3,2] and [6,+~). We further present an optimal algorithm for every r@?[2,2.5], and an almost optimal algorithm for every r@?(2.5,3] where the largest gap between its competitive ratio and the lower bound of the problem is at most 0.01417. We also present an improved algorithm with smaller competitive ratio than that of LS for every r@?(3,6).