A branch-and-bound algorithm for assembly line worker assignment and balancing problems

DOI10.1016/J.COR.2013.10.016MaRDI QIDQ2257352zbMATH OpenOpenAlexFDO

Authors Mariona Vilà, Jordi Pereira

Publication date 25 February 2015

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

Full work available at URL https://doi.org/10.1016/j.cor.2013.10.016

zbMATH Keywords

assembly line balancingbranch-and-boundmanufacturing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Theory of organizations, manpower planning in operations research (90B70)

Recommendations

• A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
• An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
• A branch, bound, and remember algorithm for the simple assembly line balancing problem
• An linear programming based lower bound for the simple assembly line balancing problem
• Branch-and-bound algorithms for the multi-product assembly line balancing problem

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
• A branch, bound, and remember algorithm for the simple assembly line balancing problem
• A classification of assembly line balancing problems
• A genetic algorithm for robotic assembly line balancing
• A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
• An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
• Assignment Problems
• Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
• Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
• Exact and approximation algorithms for makespan minimization on unrelated parallel machines
• Introduction to algorithms.
• On solving the assembly line worker assignment and balancing problem via beam search
• Procedures for the time and space constrained assembly line balancing problem
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Variable neighborhood search
• Work assignment to and qualification of multi-skilled human resources under knowledge depreciation and company skill level targets

Cited in

(28)

• Bottleneck easing-based assignment of work and product mixture determination: fuzzy assembly line balancing approach
• Branch, bound and remember algorithm for two-sided assembly line balancing problem
• A systematic approach for an application of personnel selection in assembly line balancing problem
• Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies
• Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
• Exact and heuristic methods for a workload allocation problem with chain precedence constraints
• Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm
• Exact and heuristic methods for solving the robotic assembly line balancing problem
• An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
• Developing optimization \& robust models for a mixed-model assembly line balancing problem with semi-automated operations
• Optimal workforce assignment to operations of a paced assembly line
• 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 Branch and Cut Approach for Workload Smoothing on Assembly Lines
• A memetic algorithm for the cost-oriented robotic assembly line balancing problem
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach
• Branch-and-bound algorithms for the multi-product assembly line balancing problem
• Approximation Algorithms for the Assembly Line Crew Scheduling Problem
• Procedures for the bin packing problem with precedence constraints
• A branch and bound algorithm for dynamic resource allocation in population disease management
• A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
• 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
• Exact makespan minimization of unrelated parallel machines
• scientific article; zbMATH DE number 4059101 (Why is no real title available?)
• Mixed model line balancing with parallel stations, zoning constraints, and ergonomics
• Model and metaheuristic for human-robot collaboration assembly line worker assignment and balancing problem

This page was built for publication: A branch-and-bound algorithm for assembly line worker assignment and balancing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2257352)