New applications of the Muntz and Coffman algorithm
From MaRDI portal
Publication:5946720
DOI10.1002/jos.76zbMath0980.90026MaRDI QIDQ5946720
Publication date: 14 October 2001
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jos.76
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Cites Work
- Unnamed Item
- Multiprocessor scheduling with communication delays
- Scheduling multiprocessor tasks -- An overview
- Real-time scheduling of linear speedup parallel tasks
- Scheduling preemptable tasks on parallel processors with limited availability
- Scheduling parallel tasks with sequential heads and tails
- Optimal scheduling for two-processor systems
- Scheduling with Deadlines and Loss Functions
- A Level Algorithm for Preemptive Scheduling
- Preemptive Scheduling of Uniform Processor Systems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some simple scheduling algorithms
- Optimal Preemptive Scheduling on Two-Processor Systems
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems