An enumerative heuristic and reduction methods for the assembly line balancing problem
From MaRDI portal
Publication:1869496
DOI10.1016/S0377-2217(02)00204-7zbMath1011.90039OpenAlexW2031131994MaRDI QIDQ1869496
Krzysztof Fleszar, Khalil S. Hindi
Publication date: 10 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00204-7
Related Items (25)
Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements ⋮ A versatile algorithm for assembly line balancing ⋮ Ant algorithms for a time and space constrained assembly line balancing problem ⋮ 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 ⋮ Analysis of the simple assembly line balancing problem complexity ⋮ R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines ⋮ Procedures for the time and space constrained assembly line balancing problem ⋮ A branch, bound, and remember algorithm for the simple disassembly line balancing problem ⋮ A station-oriented enumerative algorithm for two-sided assembly line balancing ⋮ SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing ⋮ A mathematical model and a genetic algorithm for two-sided assembly line balancing ⋮ A dynamic programming based heuristic for the assembly line balancing problem ⋮ Optimization framework for process scheduling of operation-dependent automobile assembly lines ⋮ Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry ⋮ Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation ⋮ A branch-and-bound algorithm to minimize the line length of a two-sided assembly line ⋮ A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem ⋮ Integrated planning for product module selection and assembly line design/reconfiguration ⋮ Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure ⋮ \texttt{Absalom}: balancing assembly lines with assignment restrictions ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing ⋮ Generation of assembly graphs by systematic analysis of assembly structures ⋮ 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
- Finding optimal line balances with OptPack
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Balancing assembly lines effectively -- a computational comparison
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Eureka: A Hybrid System for Assembly Line Balancing
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
This page was built for publication: An enumerative heuristic and reduction methods for the assembly line balancing problem
