A tight lower bound for job scheduling with cancellation

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.

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. Fung, Chung Keung Poon, Yinfeng Xu
• Keywords: Cancellation Problem, Classical Scheduling Problems, IPL 2006, Tight Lower Bound