Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements

DOI10.1016/j.ejor.2014.06.023zbMath1339.90339OpenAlexW1968973647MaRDI QIDQ2629595

Tom Pape

Publication date: 6 July 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.06.023

zbMATH Keywords

reduction techniquepartitioning problemlower boundheuristicassembly line balancing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Combinatorial optimization (90C27)

Related Items (12)

New formulations for the setup assembly line balancing and scheduling problem ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) ⋮ A memetic algorithm for the cost-oriented robotic assembly line balancing problem ⋮ Branch, bound and remember algorithm for two-sided assembly line balancing problem ⋮ 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 ⋮ Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming ⋮ Analysis of the simple assembly line balancing problem complexity ⋮ A Benders' decomposition algorithm with combinatorial cuts for the multi-manned 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

Uses Software

• SALBPGen

Cites Work

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• Procedures for the time and space constrained assembly line balancing problem
• Ant algorithms for a time and space constrained assembly line balancing problem
• A dynamic programming based heuristic for the assembly line balancing problem
• Finding optimal line balances with OptPack
• Balancing assembly lines effectively -- a computational comparison
• An enumerative heuristic and reduction methods for the assembly line balancing problem
• Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
• 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
• A versatile algorithm for assembly line balancing
• Balancing assembly lines with tabu search
• A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
• Beam-ACO for Simple Assembly Line Balancing
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
• A competitive branch-and-bound algorithm for the simple assembly line balancing problem
• Reducibility among Combinatorial Problems

This page was built for publication: Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements