Sciweavers

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

14

SWAT
2004
Springer

favoriteEmaildiscussreport

125views Algorithms» more SWAT 2004»

The Optimal Online Algorithms for Minimizing Maximum Lateness

13 years 9 months ago

The Optimal Online Algorithms for Minimizing Maximum Lateness

Download www.cs.pitt.edu

It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arrive over time on a single machine to minimize maximum lateness. It was not previously known what other online algorithms are optimal for this problem. A complete characterization of all optimal online algorithms for this problem is given.

Patchrawat Uthaisombut

Real-time Traffic

Algorithms | Online Algorithms | Optimal Algorithms | SWAT 2004 |

claim paper

Related Content

» An Optimal Incremental Algorithm for Minimizing Lateness with Rejection

» An exact method for the biobjective onemachine problem with maximum lateness and unit fami...

» Improved dynamic programs for some batching problems involving the maximum lateness criter...

» Energy Efficient RealTime Scheduling

» Optimal OnLine Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

» Admission control to minimize rejections and online set cover with repetitions

» On Minimizing the Maximum Flow Time in the Online DialaRide Problem

» An Optimal Algorithm for Minimizing Energy Consumption while Limiting Maximum Delay in a M...

» Online Scheduling to Minimize the Maximum Delay Factor

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	SWAT
Authors	Patchrawat Uthaisombut

Comments (0)