A dynamic programming based heuristic for the assembly line balancing problem
From MaRDI portal
Recommendations
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1965513 (Why is no real title available?)
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- A classification of assembly line balancing problems
- A survey on problems and methods in generalized assembly line balancing
- An Algorithm for the Line Balancing Problem
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- Ant algorithms for a time and space constrained assembly line balancing problem
- Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
- Balancing assembly lines with tabu search
- Heuristics and exact algorithms for solving the Monden problem
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- State-space relaxation procedures for the computation of bounds to routing problems
- ULINO: Optimally balancing U-shaped JIT assembly lines
Cited in
(29)- Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- Assembly line balancing: what happened in the last fifteen years?
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A Multiple-rule Heuristic for Assembly Line Balancing
- A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
- Metaheuristics based on Bin Packing for the line balancing problem
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
- Reduction approaches for a generalized line balancing problem
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
- Exact and heuristic methods for solving the robotic assembly line balancing problem
- Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules
- Analysis of the simple assembly line balancing problem complexity
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem
- Procedures for the time and space constrained assembly line balancing problem
- Matheuristics: survey and synthesis
- On the complexity of assembly line balancing problems
- Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems
- A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem
- Procedures for the bin packing problem with precedence constraints
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- A Dynamic Programming Approach to Stochastic Assembly Line Balancing
- Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
This page was built for publication: A dynamic programming based heuristic for the assembly line balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958561)
