Pages that link to "Item:Q2629595"
From MaRDI portal
The following pages link to Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements (Q2629595):
Displaying 14 items.
- New formulations for the setup assembly line balancing and scheduling problem (Q280181) (← links)
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q322556) (← links)
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem (Q1654375) (← links)
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem (Q1999621) (← links)
- Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
- Branch, bound and remember algorithm for two-sided assembly line balancing problem (Q2178119) (← links)
- A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis (Q2289927) (← links)
- Multi-objective multi-model assembly line balancing problem: a quantitative study in engine manufacturing industry (Q2329535) (← links)
- Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming (Q2418162) (← links)
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem (Q2668676) (← links)
- Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm (Q2672079) (← links)
- Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
- Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm (Q6547003) (← links)
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)
