Scheduling groups of tasks with precedence constraints on three dedicated processors.
From MaRDI portal
Publication:1421466
DOI10.1016/S0166-218X(03)00302-0zbMath1074.68007MaRDI QIDQ1421466
Publication date: 26 January 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search ⋮ Complexity of two coloring problems in cubic planar bipartite mixed graphs
Cites Work
- Multiprocessor scheduling with communication delays
- Scheduling multiprocessor tasks on three dedicated processors
- Efficiency and effectiveness of normal schedules on three dedicated processors
- An approximation algorithm for scheduling on three dedicated machines
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations
This page was built for publication: Scheduling groups of tasks with precedence constraints on three dedicated processors.
