Packing items to feed assembly lines
From MaRDI portal
Publication:2384618
DOI10.1016/j.ejor.2006.09.091zbMath1149.90313MaRDI QIDQ2384618
Mauricio C. de Souza, Carlos Roberto Venâncio de Carvalho, Wellington B. Brizon
Publication date: 10 October 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.091
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A probabilistic heuristic for a computationally difficult set covering problem
- Heuristics for the flow line problem with setup costs
- Optimal on-line algorithms for variable-sized bin covering
- A modeling approach to a JIT-based ordering system
- Upper bounds and algorithms for the maximum cardinality bin packing problem.
- New bounds for multidimensional packing
- GRASP for set packing problems.
- Greedy randomized adaptive search procedures
- Algorithms for the variable sized bin packing problem
- Accelerating column generation for variable sized bin-packing problems
- Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
- An annotated bibliography of GRASP-Part II: Applications
- Variable Sized Bin Packing
- A Mathematical Programming Approach to a Deterministic Kanban System
- Note—Operations Sequencing in Discrete Parts Manufacturing
- Safety Stock versus Safety Time in MRP Controlled Production Systems
- Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly
- Algorithms – ESA 2004
- Optimal Online Algorithms for Multidimensional Packing Problems
