Pages that link to "Item:Q3703644"
From MaRDI portal
The following pages link to Bounds for Assembly Line Balancing Heuristics (Q3703644):
Displaying 14 items.
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem (Q336970) (← links)
- Comments on the hierarchically structured bin packing problem (Q477673) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Strip packing with precedence constraints and strip packing with release times (Q837172) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- On the complexity of assembly line balancing problems (Q2003432) (← links)
- Approximation algorithms for simple assembly line balancing problems (Q2125223) (← links)
- A versatile algorithm for assembly line balancing (Q2383104) (← links)
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds (Q2569064) (← links)
- Stronger upper and lower bounds for a hard batching problem to feed assembly lines (Q3503545) (← links)
- An efficient heuristic method for the simple assembly line balancing problem (Q3707758) (← links)
- Expected Behaviour of Line-Balancing Heuristics (Q3757670) (← links)
- A Multiple-rule Heuristic for Assembly Line Balancing (Q4834088) (← links)
- Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)