Bounds for Assembly Line Balancing Heuristics
From MaRDI portal
Recommendations
Cited in
(15)- Heuristic methods and applications: A categorized survey
- On the complexity of assembly line balancing problems
- Approximation algorithms for simple assembly line balancing problems
- A versatile algorithm for assembly line balancing
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- Stronger upper and lower bounds for a hard batching problem to feed assembly lines
- An efficient heuristic method for the simple assembly line balancing problem
- Expected Behaviour of Line-Balancing Heuristics
- scientific article; zbMATH DE number 4012297 (Why is no real title available?)
- Comments on the hierarchically structured bin packing problem
- A Multiple-rule Heuristic for Assembly Line Balancing
- Analysis of the simple assembly line balancing problem complexity
- Structure of polynomial-time approximation
- Strip packing with precedence constraints and strip packing with release times
This page was built for publication: Bounds for Assembly Line Balancing Heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703644)