Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the Value of Preemption in Scheduling

From MaRDI portal
Publication:3595388
Jump to:navigation, search

DOI10.1007/11830924_6zbMath1155.90374OpenAlexW1810505368MaRDI QIDQ3595388

Gil Shallom, Yair Bartal, R. A. Sitters, Stefano Leonardi

Publication date: 28 August 2007

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11830924_6



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)

Non-preemptive speed scaling







This page was built for publication: On the Value of Preemption in Scheduling

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3595388&oldid=17010631"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 03:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki