Pages that link to "Item:Q2668676"
From MaRDI portal
The following pages link to Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem (Q2668676):
Displaying 5 items.
- An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts (Q2140139) (← links)
- Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
- Integrated real-time control of mixed-model assembly lines and their part feeding processes (Q2668772) (← links)
- Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
- Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)
