Semi-on-line multiprocessor scheduling with given total processing time

Authors:
T. C. Edwin Cheng;Hans Kellerer;Vladimir Kotov
Affiliations:
Department of Logistics, The Hong Kong Polytechnic University, Kowloon, Hong Kong;Institut für Statistik und Operations Research, Universität Graz, Universitätsstraße 15, A-8010 Graz, Austria;Byelorussian State University, Faculty of Applied Mathematics and Computer Science, Byelorussian State University, Skarina ave. 4, Minsk, 220050, Byelorussia
Venue:
Theoretical Computer Science
Year:
2005

Citing 5
Cited 9

On the performance of on-line algorithms for partition problems

Acta Cybernetica
Generating adversaries for request-answer games

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On-line bin-stretching

Theoretical 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

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
Two semi-online scheduling problems on two uniform machines

Theoretical Computer Science
Best semi-online algorithms for unbounded parallel batch scheduling

Discrete Applied Mathematics
Semi-online problems on identical machines with inexact partial information

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Semi-online scheduling revisited

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

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Recent advances for a classical scheduling problem

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Semi-online scheduling problems on a small number of machines

Journal of Scheduling

Quantified Score

Hi-index	5.23

Visualization

Abstract

We are given a set of identical machines and a sequence of jobs, the sum of whose weights is known in advance. The jobs are to be assigned on-line to one of the machines and the objective is to minimize the makespan. An algorithm with performance ratio 1.6 and a lower bound of 1.5 is presented. These results improve on the recent results by Azar and Regev, who proposed an algorithm with performance ratio 1.625 for the less general problem that the optimal makespan is known in advance.