A linear compound algorithm for uniform machine scheduling

DOI10.1007/BF02684446MaRDI QIDQ1266304zbMATH OpenOpenAlexFDO

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

Recommendations

• Uniform machine scheduling with machine available constraints
• An On-Line Algorithm for Some Uniform Processor Scheduling
• Scheduling on uniform nonsimultaneous parallel machines
• A new algorithm for online uniform-machine scheduling to minimize the makespan

Cites work

• scientific article; zbMATH DE number 1559404 (Why is no real title available?)
• A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• A note on MULTIFIT scheduling for uniform machines
• Analysis of a Compound Bin Packing Algorithm
• Bounds for LPT Schedules on Uniform Processors
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Joint performance of greedy heuristics for the integer knapsack problem
• Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems

Cited in

(5)

• Linear time algorithms for parallel machine scheduling
• Single parameter analysis of power of preemption on two and three uniform machines
• Semi-online scheduling with known maximum job size on two uniform machines
• Two semi-online scheduling problems on two uniform machines
• scientific article; zbMATH DE number 1559110 (Why is no real title available?)

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

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