Optimal semi-online scheduling algorithms on a small number of machines

Authors:
Yong Wu;Zhiyi Tan;Qifan Yang
Affiliations:
Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou, P. R. China;Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou, P. R. China;Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou, P. R. China
Venue:
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Year:
2007

Citing 7
Cited 1

Semi on-line scheduling on two identical machines

Computing
On-line bin-stretching

Theoretical Computer Science
Semi-on-line multiprocessor scheduling with given total processing time

Theoretical Computer Science
Optimal semi-online algorithms for machine covering

Theoretical Computer Science
A note on semi-online machine covering

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Semi on-line algorithms for the partition problem

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

Operations Research Letters

Semi-online scheduling problems on a small number of machines

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers semi-online scheduling problems on parallel identical machines with combined partial information. For the objective to minimize makespan, and both the largest processing time of all jobs and the total processing time of all jobs are known in advance, we present an optimal algorithm with competitive ratio 4/3 on three machines. For the objective to maximize the minimum machine load, and both the largest processing time of all jobs and the optimal value are known in advance, we present algorithms which are optimal when the machine number is less than 5.