A Short Note on an Advance in Estimating the Worst-Case Performance Ratio of the MPS Algorithm
From MaRDI portal
Publication:3058555
DOI10.1137/08071675XzbMath1207.68447OpenAlexW2058840936MaRDI QIDQ3058555
Francesca Vocaturo, Giuseppe Paletta
Publication date: 3 December 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/08071675x
Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (3)
Partial solutions and multifit algorithm for multiprocessor scheduling ⋮ A note on posterior tight worst-case bounds for longest processing time schedules ⋮ A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
This page was built for publication: A Short Note on an Advance in Estimating the Worst-Case Performance Ratio of the MPS Algorithm
