Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

STOC
1997
ACM

favoriteEmaildiscussreport

129views Algorithms» more STOC 1997»

Better Bounds for Online Scheduling

13 years 8 months ago

Better Bounds for Online Scheduling

Download www2.informatik.hu-berlin.de

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

Real-time Traffic

Algorithms | Classical Problem | Identical Parallel Machines | Online Scheduling | STOC 1997 |

claim paper

Related Content

» Better bounds for online load balancing on unrelated machines

» A new algorithm for online uniformmachine scheduling to minimize the makespan

» Improved OnLine Broadcast Scheduling with Deadlines

» Better Bounds on Online Unit Clustering

» Optimal on Demand Packet Scheduling in SingleHop Multichannel Communication Systems

» Job Shop Scheduling with Unit Length Tasks Bounds and Algorithms

» A Randomized Online Learning Algorithm for Better Variance Control

» PowerAware Scheduling of Mixed Task Sets in PriorityDriven Systems

» Scheduling Periodic RealTime Tasks with Heterogeneous Reward Requirements

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	STOC
Authors	Susanne Albers

Comments (0)