Parametric bounds for LPT scheduling on uniform processors

DOI10.1007/BF02080204zbMath0745.90034MaRDI QIDQ1179414

Bo Chen

Publication date: 26 June 1992

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

performance guaranteesmakespanlargest processing time algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem ⋮ New approximation bounds for LPT scheduling ⋮ Worst-case analysis of LPT scheduling on a small number of non-identical processors ⋮ A note on MULTIFIT scheduling for uniform machines

Cites Work

• Scheduling Independent Tasks on Uniform Processors
• Tighter Bounds for LPT Scheduling on Uniform Processors
• Bounds for LPT Schedules on Uniform Processors
• Bounds on Multiprocessing Timing Anomalies
• Unnamed Item

This page was built for publication: Parametric bounds for LPT scheduling on uniform processors