Approximation algorithms for scheduling and packing problems

DOI10.1007/978-3-642-29116-6_1MaRDI QIDQ2896371zbMATH OpenOpenAlexFDO

Authors 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_1

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• New algorithmic results for bin packing and scheduling
• scientific article; zbMATH DE number 1839427
• A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
• Approximation schemes for scheduling on parallel machines
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach

Cited in

(11)

• On the weak computability of a four dimensional orthogonal packing and time scheduling problem
• Approximation Algorithms for the Assembly Line Crew Scheduling Problem
• Algorithms and complexity for scheduling and packing problems
• Tight approximations for resource constrained scheduling and bin packing
• Bounding the running time of algorithms for scheduling and packing problems
• Approximation Algorithms for Demand Strip Packing
• Computational Science and Its Applications – ICCSA 2004
• Partially ordered knapsack and applications to scheduling
• scientific article; zbMATH DE number 1839427 (Why is no real title available?)
• Linear time algorithms for multiple cluster scheduling and multiple strip packing
• New algorithmic results for bin packing and scheduling

This page was built for publication: Approximation algorithms for scheduling and packing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896371)