New applications of the Muntz and Coffman algorithm

DOI10.1002/jos.76zbMath0980.90026OpenAlexW2004651263MaRDI QIDQ5946720

Maciej Drozdowski

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

zbMATH Keywords

deterministic schedulingpreemptive scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Malleable scheduling for flows of jobs and applications to MapReduce

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

This page was built for publication: New applications of the Muntz and Coffman algorithm