Parametric bounds for LPT scheduling on uniform processors
From MaRDI portal
Publication:1179414
DOI10.1007/BF02080204zbMath0745.90034MaRDI QIDQ1179414
Publication date: 26 June 1992
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
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
This page was built for publication: Parametric bounds for LPT scheduling on uniform processors