Scheduling Jobs on Identical and Uniform Processors Revisited

DOI10.1007/978-3-642-29116-6_10zbMath1242.68036OpenAlexW1447903712MaRDI QIDQ2896383

Christina Robenek, Klaus Jansen

Publication date: 16 July 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-29116-6_10

zbMATH Keywords

bin packingEPTASscheduling on uniform processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (4)

Tightness of sensitivity and proximity bounds for integer linear programs ⋮ An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints ⋮ An efficient polynomial time approximation scheme for load balancing on uniformly related machines ⋮ A PTAS for Scheduling Unrelated Machines of Few Different Types

This page was built for publication: Scheduling Jobs on Identical and Uniform Processors Revisited