New Algorithmic Results for Bin Packing and Scheduling

DOI10.1007/978-3-319-57586-5_2zbMath1486.68248OpenAlexW2606364423MaRDI QIDQ5283351

Klaus Jansen

Publication date: 21 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_2

Mathematics Subject Classification ID

Integer programming (90C10) Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (2)

Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines ⋮ Packing-based branch-and-bound for discrete malleable task scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vertices of the knapsack polytope
• Approximation schemes for scheduling on parallel machines
• Bin packing with restricted piece sizes
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Carathéodory bounds for integer cones
• Integer Programming with a Fixed Number of Variables
• Minkowski's Convex Body Theorem and Integer Programming
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• About the Structure of the Integer Cone and its Application to Bin Packing
• An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: New Algorithmic Results for Bin Packing and Scheduling