Sciweavers

WAOA
2005
Springer

A Note on Semi-online Machine Covering

13 years 9 months ago
A Note on Semi-online Machine Covering
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm is given in advance the optimal value of the smallest load for the given instance, and then the jobs are scheduled one by one as they arrive, without any knowledge of the following jobs. We present a deterministic algorithm with competitive
Tomás Ebenlendr, John Noga, Jiri Sgall, Ger
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where WAOA
Authors Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger
Comments (0)