A branch-and-bound algorithm for assembly line worker assignment and balancing problems
From MaRDI portal
Publication:2257352
DOI10.1016/j.cor.2013.10.016zbMath1307.90090MaRDI QIDQ2257352
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
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B70: Theory of organizations, manpower planning in operations research
Related Items
Exact and heuristic methods for a workload allocation problem with chain precedence constraints, Procedures for the bin packing problem with precedence constraints, 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, 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, Optimal workforce assignment to operations of a paced assembly line, Mixed model line balancing with parallel stations, zoning constraints, and ergonomics, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, 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, Developing optimization \& robust models for a mixed-model assembly line balancing problem with semi-automated operations, Exact makespan minimization of unrelated parallel machines, Branch, bound and remember algorithm for two-sided assembly line balancing problem, Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach, Bottleneck easing-based assignment of work and product mixture determination: fuzzy assembly line balancing approach, A branch and bound algorithm for dynamic resource allocation in population disease management, Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
- Procedures for the time and space constrained assembly line balancing problem
- On solving the assembly line worker assignment and balancing problem via beam search
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Variable neighborhood search
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
- 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 genetic algorithm for robotic assembly line balancing
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
- Work assignment to and qualification of multi-skilled human resources under knowledge depreciation and company skill level targets
- Assignment Problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
