A polynomial algorithm for some preemptive multiprocessor task scheduling problems
From MaRDI portal
Publication:2432888
DOI10.1016/j.ejor.2005.07.022zbMath1137.90499OpenAlexW1968573124WikidataQ62048705 ScholiaQ62048705MaRDI QIDQ2432888
Łukasz Kuszner, Michał Małafiejski
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
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- Scheduling multiprocessor tasks for mean flow time criterion
- Graph Classes: A Survey
- Minimizing total completion time in two-processor task systems with prespecified processor allocations
- Optimal Linear Ordering