Semi-online algorithms for parallel machine scheduling problems

Authors:
G. Dósa;Y. He
Affiliations:
Department of Mathematics, University of Veszprém, Veszprém, Hungary;Department of Mathematics, Zhejiang University, Hangzhou, P. R. China and State Key Lab of CAD & CG Zhejiang University, Hangzhou, P.R. China
Venue:
Computing
Year:
2004

Citing 11
Cited 10

Amortized efficiency of list update and paging rules

Communications of the ACM
On the performance of on-line algorithms for partition problems

Acta Cybernetica
A simple semi on-line algorithm for P2//Cmax with a buffer

Information Processing Letters
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
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

Optimal semi-online algorithms for machine covering

Theoretical Computer Science
Semi-online scheduling problems on two identical machines with inexact partial information

Theoretical Computer Science
List scheduling for jobs with arbitrary release times and similar lengths

Journal of Scheduling
Semi-online scheduling on two uniform processors

Theoretical Computer Science
Semi-online algorithms for scheduling with machine cost

Journal of Computer Science and Technology
Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines

Information Processing Letters
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling

Journal of Combinatorial Optimization
Semi-online problems on identical machines with inexact partial information

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Several semi-online scheduling problems on two identical machines with combined information

Theoretical Computer Science
Semi-online scheduling for jobs with release times

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers two semi-online versions of scheduling problem P2||Cmax where one type of partial information is available and one type of additional algorithmic extension is allowed simultaneously. For the semi-online version where a buffer of length 1 is available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 5/4. We also show that it does not help that the buffer length is greater than 1. For the semi-online version where two parallel processors are available and the total size of all jobs is known in advance, we present an optimal algorithm with Competitive ratio 6/5.