scientific article; zbMATH DE number 1445390

zbMath0952.90012MaRDI QIDQ4952713

Joel M. Wein, Cynthia A. Phillips, R. N. Uma

Publication date: 23 October 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmpolynomial-time algorithmscheduling problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Online Optimization of Busy Time on Parallel Machines ⋮ A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem ⋮ Fast primal-dual distributed algorithms for scheduling and matching problems ⋮ A truthful mechanism for value-based scheduling in cloud computing ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ Optimizing busy time on parallel machines ⋮ Online optimization of busy time on parallel machines ⋮ Unnamed Item ⋮ Pricing on Paths: A PTAS for the Highway Problem ⋮ Unnamed Item ⋮ A logarithmic approximation for unsplittable flow on line graphs