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

• Type: Conference
• Year: 2005
• Where: WAOA
• Authors: Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger
• Keywords: Machine Cover Problem, Semi-online Algorithm, Smallest Load, WAOA 2005