Lower bound algorithms for multiprocessor task scheduling with ready times

DOI10.1111/j.1475-3995.2005.00521.xzbMath1202.90126MaRDI QIDQ3410325

Massimiliano Caramia, Paolo Dell'Olmo, Antonio Iovanella

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

zbMATH Keywords

algorithm; lower bound; multiprocessor task scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates

Cites Work

• Unnamed Item
• 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
• Scheduling independent multiprocessor tasks