An approximation algorithm for scheduling on three dedicated machines

DOI10.1016/0166-218X(94)00160-FzbMATH Open0831.68006WikidataQ127673845 ScholiaQ127673845MaRDI QIDQ1897367FDOQ1897367

Authors 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)

Recommendations

• Approximation Algorithms for Three-Machine Open Shop Scheduling
• Approximation algorithms for scheduling unrelated parallel machines
• Scheduling multiprocessor tasks on three dedicated processors
• A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
• Scheduling parallel dedicated machines under a single non-shared resource

Cites work

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

Cited in

(14)

• Scheduling multiprocessor tasks -- An overview
• scientific article; zbMATH DE number 5525401 (Why is no real title available?)
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• Approximation algorithms for general parallel task scheduling
• Scheduling groups of tasks with precedence constraints on three dedicated processors.
• A modification of Hochbaum and Shmoys' algorithm for scheduling problems
• On spectrum assignment in elastic optical tree-networks
• A 3/2-approximation algorithm for \(k_i\)-partitioning
• 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
• Lower bound algorithms for multiprocessor task scheduling with ready times
• Processor bounding for an efficient non-preemptive task scheduling algorithm
• Efficiency and effectiveness of normal schedules on three dedicated processors
• Task splitting for three machine preemptive scheduling

This page was built for publication: An approximation algorithm for scheduling on three dedicated machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897367)