A dynamic programming based heuristic for the assembly line balancing problem
From MaRDI portal
Publication:958561
DOI10.1016/j.ejor.2008.01.016zbMath1168.90404OpenAlexW1984101080MaRDI QIDQ958561
Joaquín Bautista, Jordi Pereira
Publication date: 5 December 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.01.016
Related Items (19)
Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ Procedures for the bin packing problem with precedence constraints ⋮ A memetic algorithm for the cost-oriented robotic assembly line balancing problem ⋮ Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem ⋮ Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming ⋮ Analysis of the simple assembly line balancing problem complexity ⋮ Matheuristics: survey and synthesis ⋮ Procedures for the time and space constrained assembly line 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 ⋮ On the complexity of assembly line balancing problems ⋮ Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry ⋮ Reduction approaches for a generalized line balancing problem ⋮ Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Ant algorithms for a time and space constrained assembly line balancing problem
- Heuristics and exact algorithms for solving the Monden problem
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- A classification of assembly line balancing problems
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A survey on problems and methods in generalized assembly line balancing
- Balancing assembly lines with tabu search
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- State-space relaxation procedures for the computation of bounds to routing problems
- ULINO: Optimally balancing U-shaped JIT assembly lines
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
- An Algorithm for the Line Balancing Problem
This page was built for publication: A dynamic programming based heuristic for the assembly line balancing problem
