Pages that link to "Item:Q2901039"
From MaRDI portal
The following pages link to Beam-ACO for Simple Assembly Line Balancing (Q2901039):
Displaying 10 items.
- Beam-ACO (Q23684) (← links)
- On solving the assembly line worker assignment and balancing problem via beam search (Q709148) (← links)
- Reduction approaches for a generalized line balancing problem (Q1761168) (← links)
- Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time (Q2355812) (← links)
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements (Q2629595) (← links)
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem (Q2668676) (← links)
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem (Q2815457) (← links)
- Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
