Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies

DOI10.1016/J.EJOR.2016.11.027zbMath1402.90046OpenAlexW2553801873MaRDI QIDQ1751911

Celso Gustavo Stall Sikora, Thiago Cantos Lopes, Leandro Magatão

Publication date: 25 May 2018

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

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

zbMATH Keywords

combinatorial optimizationtraveling salesman problemmixed integer linear programmingreal-world applicationassembly line rebalancing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Production models (90B30) Case-oriented studies in operations research (90B90)

Related Items (6)

Assembly line balancing: what happened in the last fifteen years? ⋮ Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem ⋮ New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions ⋮ Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers ⋮ Balancing a robotic spot welding manufacturing line: an industrial case study ⋮ A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem

Uses Software

• SALBPGen

Cites Work

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
• Model and heuristics for the assembly line worker integration and balancing problem
• Balancing and scheduling of flexible mixed model assembly lines
• Ant algorithms for a time and space constrained assembly line balancing problem
• \texttt{Absalom}: balancing assembly lines with assignment restrictions
• The Euclidean traveling salesman problem is NP-complete
• Balancing \(U\)-lines in a multiple \(U\)-line facility
• Reduction approaches for a generalized line balancing problem
• Separate and carousel type allocations of workers in a U-shaped production line
• Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
• A branch-and-bound algorithm for assembly line worker assignment and balancing problems
• A classification of assembly line balancing problems
• Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem
• Reconfiguration of assembly lines under the influence of high product variety in the automotive industry–a decision support system
• Integer Programming Formulation of Traveling Salesman Problems
• Worker allocation in lean U-shaped production lines
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
• The mixed-model U-line balancing problem
• Workforce planning and allocation for mid-volume truck manufacturing: A case study
• The U-line Line Balancing Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Mixed Model Line Balancing with Smoothed Station Assignments

This page was built for publication: Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies