Lower bound algorithms for multiprocessor task scheduling with ready times
From MaRDI portal
Publication:3410325
DOI10.1111/j.1475-3995.2005.00521.xzbMath1202.90126OpenAlexW2121897488MaRDI QIDQ3410325
Massimiliano Caramia, Antonio Iovanella, Paolo Dell'Olmo
Publication date: 27 November 2006
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2005.00521.x
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact algorithm for the maximum clique problem
- Online algorithms. The state of the art
- 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
- Efficiency and effectiveness of normal schedules on three dedicated processors
- An approximation algorithm for scheduling on three dedicated machines
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
- Minimizing total completion time in two-processor task systems with prespecified processor allocations
- Scheduling independent multiprocessor tasks
This page was built for publication: Lower bound algorithms for multiprocessor task scheduling with ready times