A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem

DOI10.1016/j.cor.2013.12.002zbMath1348.90220arXiv1308.0299OpenAlexW2021558860MaRDI QIDQ336970

Leonardo Borba, Marcus Ritt

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.0299

zbMATH Keywords

branch-and-boundbeam searchassembly line balancingMIPheterogeneous workers

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items

Model and heuristics for the assembly line worker integration and balancing problem, The multi-objective assembly line worker integration and balancing problem of type-2, The robust (minmax regret) assembly line worker assignment and balancing problem, A memetic algorithm for the cost-oriented robotic assembly line balancing problem, Exact makespan minimization of unrelated parallel machines, Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem, Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach, Exact and heuristic methods for a workload allocation problem with chain precedence constraints, Optimal workforce assignment to operations of a paced assembly line, Developing optimization \& robust models for a mixed-model assembly line balancing problem with semi-automated operations, Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies, Exact and heuristic methods for solving the robotic assembly line balancing problem, A branch-and-bound algorithm for assembly line worker assignment and balancing problems, Robotic disassembly line balancing problem: a mathematical model and ant colony optimization approach

Uses Software

• SALBPGen

Cites Work

• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
• On solving the assembly line worker assignment and balancing problem via beam search
• Amortized efficiency of a path retrieval data structure
• Exact and approximation algorithms for makespan minimization on unrelated parallel machines
• A branch-and-bound algorithm for assembly line worker assignment and balancing problems
• A classification of assembly line balancing problems
• The stochastic U-line balancing problem: a heuristic procedure
• 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 survey on problems and methods in generalized assembly line balancing
• An linear programming based lower bound for the simple assembly line balancing problem
• A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
• Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
• Stochastic assembly line balancing using beam search