Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
type: Item
instance of: scholarly article
title: Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
zbMATH Open document ID: 1402.90046
author: Celso Gustavo Stall Sikora
author: Thiago Cantos Lopes
author: Leandro Magatão
published in: European Journal of Operational Research
publication date: 2018-05-25T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6873651
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: assembly line rebalancing
zbMATH Keywords: real-world application
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: mixed integer linear programming
describes a project that uses: SALBPGen
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.11.027
OpenAlex ID: W2553801873
cites work: Reconfiguration of assembly lines under the influence of high product variety in the automotive industry–a decision support system
cites work: Reduction approaches for a generalized line balancing problem
cites work: Ant algorithms for a time and space constrained assembly line balancing problem
cites work: A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
cites work: A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
cites work: A classification of assembly line balancing problems
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem
cites work: Workforce planning and allocation for mid-volume truck manufacturing: A case study
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Balancing \(U\)-lines in a multiple \(U\)-line facility
cites work: The U-line Line Balancing Problem
cites work: Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
cites work: Model and heuristics for the assembly line worker integration and balancing problem
cites work: Separate and carousel type allocations of workers in a U-shaped production line
cites work: Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
cites work: Balancing and scheduling of flexible mixed model assembly lines
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
cites work: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
cites work: \texttt{Absalom}: balancing assembly lines with assignment restrictions
cites work: Worker allocation in lean U-shaped production lines
cites work: The mixed-model U-line balancing problem
cites work: Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
cites work: Mixed Model Line Balancing with Smoothed Station Assignments
cites work: A branch-and-bound algorithm for assembly line worker assignment and balancing problems
DOI: 10.1016/J.EJOR.2016.11.027
description: scientific article; zbMATH DE number 6873651