Online real-time preemptive scheduling of jobs with deadlines on multiple machines

DOI10.1002/JOS.85zbMath0995.90029OpenAlexW1964047916MaRDI QIDQ1348736

Michael A. Palis, Bhaskar Das Gupta

Publication date: 24 October 2002

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.85

zbMATH Keywords

online algorithmsapproximation algorithmsreal-time scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Automated competitive analysis of real-time scheduling with graph games ⋮ Online C-benevolent job scheduling on multiple machines ⋮ Online interval scheduling to maximize total satisfaction ⋮ Efficient job scheduling algorithms with multi-type contentions

Cites Work

• Unnamed Item
• Unnamed Item
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• On the competitiveness of on-line real-time task scheduling
• On the approximability of an interval scheduling problem
• Approximating the throughput of multiple machines under real-time scheduling
• Improvements in throughout maximization for real-time scheduling
• Algorithms for Scheduling Independent Tasks
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Online real-time preemptive scheduling of jobs with deadlines on multiple machines