New algorithmic results for bin packing and scheduling

DOI10.1007/978-3-319-57586-5_2MaRDI QIDQ5283351zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Approximation algorithms for scheduling and packing problems
• scientific article; zbMATH DE number 3890754
• A Packing Problem You Can Almost Solve by Sitting on Your Suitcase
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Batched bin packing revisited

Cites work

• 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
• Approximation algorithms for NP-hard problems.
• Approximation schemes for scheduling on parallel machines
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Bin packing with restricted piece sizes
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Carathéodory bounds for integer cones
• scientific article; zbMATH DE number 6820261 (Why is no real title available?)
• scientific article; zbMATH DE number 6472625 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Minkowski's Convex Body Theorem and Integer Programming
• The vertices of the knapsack polytope

Cited in

(7)

• Packing-based branch-and-bound for discrete malleable task scheduling
• Approximation algorithms for scheduling and packing problems
• scientific article; zbMATH DE number 6719727 (Why is no real title available?)
• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• Streaming algorithms for bin packing and vector scheduling
• Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
• Complexity of scheduling few types of jobs on related and unrelated machines

This page was built for publication: New algorithmic results for bin packing and scheduling

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