Approximation results for makespan minimization with budgeted uncertainty

DOI10.1007/978-3-030-39479-0_5OpenAlexW3205066486MaRDI QIDQ5918896

Klaus Jansen, Michael Poss, Lars Rohwedder, Marin Bougeret

Publication date: 24 August 2020

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.08592

zbMATH Keywords

parallel machinesrobust optimizationmakespan minimizationapproximation algorithmsunrelated machinesEPTAS

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Online makespan minimization with budgeted uncertainty ⋮ Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty

This page was built for publication: Approximation results for makespan minimization with budgeted uncertainty