Efficiency and effectiveness of normal schedules on three dedicated processors
From MaRDI portal
Publication:1356693
DOI10.1016/S0012-365X(97)84781-4zbMath0871.90045MaRDI QIDQ1356693
Zsolt Tuza, Paolo Dell'Olmo, Maria Grazia Speranza
Publication date: 10 June 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
probabilistic analysisapproximation algorithmsgraph theoretical modelsminimum makespannonpreemptive schedulethree processors
Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
An approximation result for the interval coloring problem on claw-free chordal graphs, A simple linear time approximation algorithm for multi-processor job scheduling on four processors, Graph models for scheduling systems with machine saturation property, Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs, Scheduling groups of tasks with precedence constraints on three dedicated processors., Comparability graph augmentation for some multiprocessor scheduling problems, Lower bound algorithms for multiprocessor task scheduling with ready times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiprocessor scheduling with communication delays
- Scheduling subject to resource constraints: Classification and complexity
- The complexity of scheduling independent two-processor tasks on dedicated processors
- Scheduling multiprocessor tasks on three dedicated processors
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- An approximation algorithm for scheduling on three dedicated machines
- Scheduling independent tasks with multiple modes
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Complexity of Scheduling Parallel Task Systems
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations
