A tight lower bound for job scheduling with cancellation

13 years 4 months ago

Download www.cs.cityu.edu.hk

The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a tight lower bound of 5 for the competitive ratio of any deterministic online algorithm for this problem, for the case where all jobs have the same processing time. 2005 Elsevier B.V. All rights reserved.

Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. F

Real-time Traffic

Cancellation Problem | Classical Scheduling Problems | IPL 2006 | Tight Lower Bound |

claim paper

» Improved Bounds for Flow Shop Scheduling

» Semionline scheduling with end of sequence information

» Lower Bound for EnvyFree and Truthful Makespan Approximation on Related Machines

» Lower Bounds for Smiths Rule in Stochastic Machine Scheduling

» A Lower Bound for Dynamic Scheduling of Data Parallel Programs

» Preemptive Online Scheduling with Reordering

» Online scheduling of weighted equallength jobs with hard deadlines on parallel machines

» Online Scheduling of EqualLength Jobs Randomization and Restarts Help

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	IPL
Authors	Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. Fung, Chung Keung Poon, Yinfeng Xu

Comments (0)

Sciweavers

A tight lower bound for job scheduling with cancellation

Cancellation Problem | Classical Scheduling Problems | IPL 2006 | Tight Lower Bound |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers