An approximation algorithm for scheduling on three dedicated machines

DOI10.1016/0166-218X(94)00160-FzbMath0831.68006WikidataQ127673845 ScholiaQ127673845MaRDI QIDQ1897367

Michel X. Goemans

Publication date: 27 August 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

scheduling problem

Mathematics Subject Classification ID

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 ⋮ Efficiency and effectiveness of normal schedules on three dedicated processors ⋮ A simple linear time approximation algorithm for multi-processor job scheduling on four processors ⋮ Scheduling groups of tasks with precedence constraints on three dedicated processors. ⋮ On spectrum assignment in elastic optical tree-networks ⋮ Processor bounding for an efficient non-preemptive task scheduling algorithm ⋮ Scheduling multiprocessor tasks -- An overview ⋮ Lower bound algorithms for multiprocessor task scheduling with ready times ⋮ Approximation algorithms for general parallel task scheduling

Cites Work

• Multiprocessor scheduling with communication delays
• The complexity of scheduling independent two-processor tasks on dedicated processors
• Scheduling multiprocessor tasks on three dedicated processors
• Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Scheduling File Transfers
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations