Sciweavers

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

14

MST
2008

favoriteEmaildiscussreport

157views more MST 2008»

Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

13 years 4 months ago

Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

Download math.haifa.ac.il

We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider three versions of this problem, preemptive semi-online, non-preemptive on-line and preemptive on-line scheduling. For all these cases we design algorithms with best possible competitive ratios as functions of the machine speeds.

Leah Epstein, Arik Ganot

Real-time Traffic

Algorithms | MST 2008 | On-line Scheduling | Preemptive On-line Scheduling |

claim paper

Related Content

» Pathindependent load balancing with unreliable machines

» Preemptive scheduling on a small number of hierarchical machines

» The hierarchical model for load balancing on two machines

» A Robust PTAS for Machine Covering and Packing

» Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines

» Machine scheduling with resource dependent processing times

» Parallel processor scheduling with delay constraints

» A Hybrid Method for Planning and Scheduling

» Online Tree Node Assignment with Resource Augmentation

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	MST
Authors	Leah Epstein, Arik Ganot

Comments (0)