On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
From MaRDI portal
Publication:5757371
DOI10.1137/S0895480101396949zbMath1127.90028OpenAlexW1994736182MaRDI QIDQ5757371
Publication date: 6 September 2007
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480101396949
Analysis of algorithms (68W40) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Related Items (6)
Faster and simpler approximation algorithms for mixed packing and covering problems ⋮ Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques ⋮ Approximation algorithms for general packing problems and their application to the multicast congestion problem ⋮ Register loading via linear programming ⋮ A faster FPTAS for knapsack problem with cardinality constraint ⋮ A faster FPTAS for knapsack problem with cardinality constraint
This page was built for publication: On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes