An approximation algorithm for scheduling on three dedicated machines

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

Michel X. Goemans

Publication date: 27 August 1995

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

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

zbMATH Keywords

scheduling problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• An approximation result for the interval coloring problem on claw-free chordal graphs
• Approximation algorithms for general parallel task scheduling
• On spectrum assignment in elastic optical tree-networks
• A simple linear time approximation algorithm for multi-processor job scheduling on four processors
• Processor bounding for an efficient non-preemptive task scheduling algorithm
• Efficiency and effectiveness of normal schedules on three dedicated processors
• Scheduling multiprocessor tasks -- An overview
• Title not available (Why is that?)
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• Scheduling groups of tasks with precedence constraints on three dedicated processors.
• A modification of Hochbaum and Shmoys' algorithm for scheduling problems
• Lower bound algorithms for multiprocessor task scheduling with ready times
• 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)