On-line approximation algorithms for scheduling tasks on identical machines with extendable working time

DOI10.1023/A:1018935608981zbMath0921.90098OpenAlexW283730594MaRDI QIDQ1290163

Maria Grazia Speranza, Zsolt Tuza

Publication date: 10 June 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018935608981

zbMATH Keywords

bin packingcompletion timeon-line problemassigning tasks to identical machineslist scheduling heuristicworst-case relative error

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Approximation schemes for the generalized extensible bin packing problem, A 13/12 approximation algorithm for bin packing with extendable bins, Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers, On-line scheduling with extendable working time on a small number of machines, Applying extra-resource analysis to load balancing.