A tight lower bound for job scheduling with cancellation

Authors:
Feifeng Zheng;Francis Y. L. Chin;Stanley P. Y. Fung;Chung Keung Poon;Yinfeng Xu
Affiliations:
School of Management, Xi'an Jiao Tong University, China;Department of Computer Science, The University of Hong Kong, Hong Kong, China;Department of Computer Science, The University of Hong Kong, Hong Kong, China;Department of Computer Science, City University of Hong Kong, China;School of Management, Xi'an Jiao Tong University, China
Venue:
Information Processing Letters
Year:
2006

Citing 3
Cited 2

On-line scheduling of jobs with fixed start and end times

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Online computation and competitive analysis

Online computation and competitive analysis
Scheduling broadcasts with deadlines

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

A near optimal scheduler for on-demand data broadcasts

Theoretical Computer Science
Improved on-line broadcast scheduling with deadlines

Journal of Scheduling

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.