scientific article; zbMATH DE number 2086672

From MaRDI portal

Revision as of 21:56, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4737209

Jump to:navigation, search

zbMath1057.68542MaRDI QIDQ4737209

Jiří Sgall, Nodari Vakhania, John Noga, Rob van Stee, Leah Epstein, Tomas Tichý, Marek Chrobak

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800800.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

Online scheduling with partial job values: does timesharing or randomization help? ⋮ Scheduling search procedures: The wheel of fortune ⋮ Preemptive scheduling in overloaded systems. ⋮ A tighter extra-resource analysis of online deadline scheduling ⋮ New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4737209&oldid=18999116"