A polynomial algorithm for some preemptive multiprocessor task scheduling problems
From MaRDI portal
Publication:2432888
DOI10.1016/j.ejor.2005.07.022zbMath1137.90499WikidataQ62048705 ScholiaQ62048705MaRDI QIDQ2432888
Michał Małafiejski, Łukasz Kuszner
Publication date: 25 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.07.022
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Cites Work