The maximum gain of increasing the number of preemptions in multiprocessor scheduling

DOI10.1007/s00236-009-0096-5zbMath1179.68019OpenAlexW2148019337MaRDI QIDQ2390934

Kamilla Klonowska, Håkan Lennerstad, Lars-Erik Lundberg

Publication date: 10 August 2009

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-009-0096-5

zbMATH Keywords

optimal makespan

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 (3)

Parallel machine covering with limited number of preemptions ⋮ Algorithms with limited number of preemptions for scheduling on parallel machines ⋮ The n-dimensional Stern–Brocot tree

Cites Work

• Unnamed Item
• Optimal scheduling combinatorics
• Scheduling with Deadlines and Loss Functions
• Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
• Parallel Processor Scheduling with Limited Number of Preemptions
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: The maximum gain of increasing the number of preemptions in multiprocessor scheduling