Better Bounds for Online Scheduling

13 years 10 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goal is to minimize the makespan. Bartal, Fiat, Karlo and Vohra 3] gave a deterministic online
Susanne Albers
Added 07 Aug 2010
Updated 07 Aug 2010
Type Conference
Year 1997
Where STOC
Authors Susanne Albers
Comments (0)