A note on MULTIFIT scheduling for uniform machines

DOI10.1007/BF02684354zbMath0913.90161OpenAlexW1973908586MaRDI QIDQ1272356

Rainer E. Burkard, Yong He

Publication date: 21 December 1998

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02684354

zbMATH Keywords

worst case boundMULTIFIT heuristictwo parallel uniform machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (4)

A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem ⋮ Approximation for scheduling on uniform nonsimultaneous parallel machines ⋮ Scheduling on uniform processors with at most one downtime on each machine ⋮ A linear compound algorithm for uniform machine scheduling

Cites Work

• Tighter bound for MULTIFIT scheduling on uniform processors
• Parametric bounds for LPT scheduling on uniform processors
• Scheduling Independent Tasks on Uniform Processors
• Bounds for Multifit Scheduling on Uniform Processors
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Tighter Bounds for LPT Scheduling on Uniform Processors
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Bounds for LPT Schedules on Uniform Processors
• An Application of Bin-Packing to Multiprocessor Scheduling
• A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines

This page was built for publication: A note on MULTIFIT scheduling for uniform machines