On-line scheduling with tight deadlines.
type: Item
instance of: scholarly article
title: On-line scheduling with tight deadlines.
zbMATH Open document ID: 1053.68015
DOI: 10.1016/S0304-3975(02)00407-3
author: Chiu-Yuen Koo
author: Kunihiko Sadakane
author: Kar-Keung To
author: Tak-Wah Lam
author: Tsuen-Wan Johnny Ngan
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1965277
zbMATH Keywords: On-line algorithms
zbMATH Keywords: Competitive analysis
zbMATH Keywords: Deadline scheduling
MaRDI profile type: Publication
cites work: On the competitiveness of on-line real-time task scheduling
cites work: Q4719334
cites work: Q4952667
cites work: Q2753730
cites work: Scheduling in the dark
cites work: Maximizing job completions online
cites work: Speed is as powerful as clairvoyance
cites work: $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
cites work: Q4252341
cites work: Performance guarantee for online deadline scheduling in the presence of overload
cites work: Q4526977
cites work: Online algorithms. The state of the art
cites work: Q4208561
full work available at URL: s0304-3975(02)00407-3
OpenAlex ID: W1558203020
Recommended article: Q4779165
Recommended article: Online Scheduling with Hard Deadlines
Recommended article: On-line scheduling to maximize task completions.
Recommended article: Aggressive online deadline scheduling
Recommended article: Online deadline scheduling on faster machines.
Recommended article: Q2753936
Recommended article: Online scheduling with preemption or non-completion penalties
Recommended article: Q3128889
Recommended article: Online scheduling with reassignment
Recommended article: Online Scheduling with Known Arrival Times
description: scientific article; zbMATH DE number 1965277