Procedures for the bin packing problem with precedence constraints
From MaRDI portal
Publication:322561
DOI10.1016/j.ejor.2015.10.048zbMath1346.90716OpenAlexW1879823070MaRDI QIDQ322561
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.10.048
Related Items
The robust (minmax regret) assembly line worker assignment and balancing problem ⋮ Analysis of the simple assembly line balancing problem complexity ⋮ R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines ⋮ Bin Packing Problem with Time Lags ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints ⋮ Packing-based branch-and-bound for discrete malleable task scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- Mathematical programming algorithms for bin packing problems with item fragmentation
- Algorithms and implementation of a set partitioning approach for modular machining line design
- Procedures for the time and space constrained assembly line balancing problem
- A survey of dual-feasible and superadditive functions
- Strip packing with precedence constraints and strip packing with release times
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- A dynamic programming based heuristic for the assembly line balancing problem
- Resource constrained scheduling as generalized bin packing
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- Heuristics and lower bounds for the bin packing problem with conflicts
- LP models for bin packing and cutting stock problems
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- An linear programming based lower bound for the simple assembly line balancing problem
- Fast lifting procedures for the bin packing problem
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- Algorithms for the Bin Packing Problem with Conflicts
- Developing and Deploying Electronics Assembly Line Optimization Tools: A Motorola Case Study
- State-space relaxation procedures for the computation of bounds to routing problems
- An Algorithm for Subgraph Isomorphism
- The Bin Packing Problem with Precedence Constraints
- New classes of fast lower bounds for bin packing problems
