A tight lower bound for job scheduling with cancellation
type: Item
instance of: scholarly article
title: A tight lower bound for job scheduling with cancellation
zbMATH Open document ID: 1184.68142
author: Feifeng Zheng
author: Francis Y. L. Chin
author: Stanley P. Y. Fung
author: Chung Keung Poon
author: Yinfeng Xu
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 5650161
zbMATH Keywords: on-line algorithms
zbMATH Keywords: scheduling
zbMATH Keywords: lower bounds
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.09.001
OpenAlex ID: W2160705700
cites work: Q4223058
cites work: Computing and Combinatorics
cites work: Scheduling Broadcasts with Deadlines
cites work: On-line scheduling of jobs with fixed start and end times
DOI: 10.1016/J.IPL.2005.09.001
description: scientific article; zbMATH DE number 5650161