Online real-time preemptive scheduling of jobs with deadlines on multiple machines
type: Item
instance of: scholarly article
title: Online real-time preemptive scheduling of jobs with deadlines on multiple machines
zbMATH Open document ID: 0995.90029
author: Michael A. Palis
author: Bhaskar Dasgupta
published in: Journal of Scheduling
publication date: 2002-10-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1740592
zbMATH Keywords: real-time scheduling
zbMATH Keywords: online algorithms
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: jos.85
OpenAlex ID: W1964047916
cites work: Q3128889
cites work: Q4952665
cites work: Approximating the throughput of multiple machines under real-time scheduling
cites work: Algorithms for Scheduling Independent Tasks
cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
cites work: A unified approach to approximating resource allocation and scheduling
cites work: Improvements in throughout maximization for real-time scheduling
cites work: On the approximability of an interval scheduling problem
cites work: On the competitiveness of on-line real-time task scheduling
cites work: $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
DOI: 10.1002/JOS.85
Recommended article: Q2753730
Recommended article: Online scheduling of parallel jobs with preemption on two identical machines
Recommended article: Online Scheduling with Hard Deadlines on Parallel Machines
Recommended article: On-line preemptive scheduling on uniform machines
Recommended article: Online scheduling of jobs with kind release times and deadlines on a single machine
Recommended article: Q4551382
Recommended article: Online Scheduling of Precedence Constrained Tasks
Recommended article: The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times
Recommended article: Preemptive online algorithms for scheduling with machine cost
description: scientific article; zbMATH DE number 1740592