On solving the assembly line worker assignment and balancing problem via beam search
From MaRDI portal
Publication:709148
DOI10.1016/j.cor.2010.05.008zbMath1231.90256OpenAlexW2031941629MaRDI QIDQ709148
Christian Blum, Cristóbal Miralles
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/88013
Discrete location and assignment (90B80) Theory of organizations, manpower planning in operations research (90B70)
Related Items
Assembly line balancing: what happened in the last fifteen years?, 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, An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II, Algorithms and implementation of a set partitioning approach for modular machining line design, A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan, A memetic algorithm for the cost-oriented robotic assembly line balancing problem, 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, 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, Exact and heuristic methods for solving the robotic assembly line balancing problem, Flow shop scheduling with heterogeneous workers, Reduction approaches for a generalized line balancing problem, A branch-and-bound algorithm for assembly line worker assignment and balancing problems, Bottleneck easing-based assignment of work and product mixture determination: fuzzy assembly line balancing approach, The risk-averse traveling repairman problem with profits
Cites Work
- Beam search for the longest common subsequence problem
- Optimally balancing assembly lines with different workstations
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Job shop scheduling with beam search
- 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 special case of transfer lines balancing by graph approach
- Assembly System Design: A Branch and Cut Approach
- Beam-ACO for Simple Assembly Line Balancing
- A family of hierarchical models for the design of deterministic assembly systems
- Hybrid assembly line design and user's preferences
- Improved lower bounds for the early/tardy scheduling problem with no idle time
