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

• Type: Conference
• Year: 1997
• Where: STOC
• Authors: Susanne Albers
• Keywords: Algorithms, Classical Problem, Identical Parallel Machines, Online Scheduling, STOC 1997