scientific article; zbMATH DE number 6118219
From MaRDI portal
Publication:3145801
Cited in
(26)- Improved lower bounds for semi-online bin packing problems
- On dynamic bin packing: An improved lower bound and resource augmentation analysis
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
- The optimal absolute ratio for online bin packing
- Batched bin packing
- New lower bounds for the three-dimensional finite bin packing problem
- Heuristic algorithms for the three-dimensional bin packing problem
- Dynamic bin packing of unit fractions items
- Approximation and online algorithms for multidimensional bin packing: a survey
- Online bin packing of fragile objects with application in cellular networks
- On-line bin packing with restricted repacking
- Online bin packing with arbitrary release times
- Semi-on-line bin packing: a short overview and a new lower bound
- Procedures for the bin packing problem with precedence constraints
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Lower and upper bounds for the bin packing problem with fragile objects
- Selfish bin packing
- Bin Packing with Queues
- Space and time allocation in a shipyard assembly hall
- Routing problems with loading constraints
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
- Station assignment with reallocation
- A goal-driven iterated local search approach based on the maximal-space for the circle bin-packing problem with rectangular items
- On online approximation algorithms for two-stage bins
- Comparing loading strategies for auto-trains: balancing efficiency with information requirements
- Data-driven stochastic game theoretic differential dynamic programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3145801)
