A linear compound algorithm for uniform machine scheduling

DOI10.1007/BF02684446zbMath0909.90173OpenAlexW1997535791MaRDI QIDQ1266304

Rainer E. Burkard, Yong He, Hans Kellerer

Publication date: 16 March 1999

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

worst-case boundtwo uniform machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Linear time algorithms for parallel machine scheduling ⋮ Semi-online scheduling with known maximum job size on two uniform machines ⋮ Two semi-online scheduling problems on two uniform machines ⋮ Single parameter analysis of power of preemption on two and three uniform machines

Cites Work

• Unnamed Item
• A note on MULTIFIT scheduling for uniform machines
• Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
• Joint performance of greedy heuristics for the integer knapsack problem
• Analysis of a Compound Bin Packing Algorithm
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Bounds for LPT Schedules on Uniform Processors
• A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines

This page was built for publication: A linear compound algorithm for uniform machine scheduling