Approximation for scheduling on uniform nonsimultaneous parallel machines

DOI10.1007/s10951-016-0501-1zbMath1386.90053OpenAlexW2555405620MaRDI QIDQ1702658

Liliana Grigoriu, Donald K. Friesen

Publication date: 28 February 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-016-0501-1

zbMATH Keywords

multiprocessor schedulingworst-case boundsmakespanuniform processorsMULTIFITnonsimultaneous start times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation

Cites Work

• Scheduling on same-speed processors with at most one downtime on each machine
• Parallel machines scheduling with nonsimultaneous machine available time
• On the exact upper bound for the Multifit processor scheduling algorithm
• Tighter bound for MULTIFIT scheduling on uniform processors
• A note on MULTIFIT scheduling for uniform machines
• The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
• Uniform machine scheduling with machine available constraints
• Scheduling on uniform processors with at most one downtime on each machine
• Approximability of scheduling with fixed jobs
• Exact performance of MULTIFIT for nonsimultaneous machines
• Bounds for Multifit Scheduling on Uniform Processors
• An Application of Bin-Packing to Multiprocessor Scheduling
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Approximation for scheduling on uniform nonsimultaneous parallel machines