Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
From MaRDI portal
Publication:2629595
Recommendations
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- Heuristic for balancing a simple assembly line (SALBP, type-1 problem)
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Improving the resolution of the simple assembly line balancing problem type E
Cites work
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- A dynamic programming based heuristic for the assembly line balancing problem
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- A versatile algorithm for assembly line balancing
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- Ant algorithms for a time and space constrained assembly line balancing problem
- Balancing assembly lines effectively -- a computational comparison
- Balancing assembly lines with tabu search
- Beam-ACO for simple assembly line balancing
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
- Finding optimal line balances with OptPack
- Procedures for the time and space constrained assembly line balancing problem
- Reducibility among combinatorial problems
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
Cited in
(25)- A memetic algorithm for the cost-oriented robotic assembly line balancing problem
- Balancing assembly lines effectively -- a computational comparison
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- Assembly line balancing: what happened in the last fifteen years?
- Branch, bound and remember algorithm for two-sided assembly line balancing problem
- A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis
- Multi-objective multi-model assembly line balancing problem: a quantitative study in engine manufacturing industry
- Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- An linear programming based lower bound for the simple assembly line balancing problem
- Balancing assembly lines with tabu search
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
- Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm
- New formulations for the setup assembly line balancing and scheduling problem
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
- An efficient heuristic method for the simple assembly line balancing problem
- Heuristic for balancing a simple assembly line (SALBP, type-1 problem)
- Analysis of the simple assembly line balancing problem complexity
- Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
- Flight test scheduling: a generic model, lower bounds, and iterated local search
- New solution approaches for balancing assembly lines with setup times
- A dynamic programming based heuristic for the assembly line balancing problem
This page was built for publication: Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629595)
