Optimal scheduling combinatorics

zbMath1109.90041MaRDI QIDQ878329

Håkan Lennerstad, Lars-Erik Lundberg

Publication date: 26 April 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (1)

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

This page was built for publication: Optimal scheduling combinatorics