On solving the assembly line worker assignment and balancing problem via beam search
From MaRDI portal
Publication:709148
Recommendations
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
- Iterative beam search for simple assembly line balancing with a fixed number of work stations
- Beam-ACO for simple assembly line balancing
- Stochastic assembly line balancing using beam search
Cites work
- A classification of assembly line balancing problems
- A family of hierarchical models for the design of deterministic assembly systems
- A special case of transfer lines balancing by graph approach
- Assembly system design: A branch and cut approach
- Beam search for the longest common subsequence problem
- Beam-ACO for simple assembly line balancing
- Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
- Hybrid assembly line design and user's preferences
- Improved lower bounds for the early/tardy scheduling problem with no idle time
- Job shop scheduling with beam search
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Optimally balancing assembly lines with different workstations
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
Cited in
(28)- An efficient hybridization of ant colony optimization and genetic algorithm for an assembly line balancing problem of type II under zoning constraints
- Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
- Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
- Model and metaheuristic for human-robot collaboration assembly line worker assignment and balancing problem
- Bottleneck easing-based assignment of work and product mixture determination: fuzzy assembly line balancing approach
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem
- Beam-ACO for simple assembly line balancing
- Exact and heuristic methods for solving the robotic assembly line balancing problem
- The risk-averse traveling repairman problem with profits
- Developing optimization \& robust models for a mixed-model assembly line balancing problem with semi-automated operations
- Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach
- Assembly line balancing: what happened in the last fifteen years?
- Optimal workforce assignment to operations of a paced assembly line
- Iterative beam search for simple assembly line balancing with a fixed number of work stations
- The multi-objective assembly line worker integration and balancing problem of type-2
- The robust (minmax regret) assembly line worker assignment and balancing problem
- Generic machine-learning-augmented beam search for resource-constrained shortest path reformulations of combinatorial optimization problems
- Algorithms and implementation of a set partitioning approach for modular machining line design
- Stochastic assembly line balancing using beam search
- Enhanced branch-bound-remember and iterative beam search algorithms for type II 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
- An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
- A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine's types
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
- Reduction approaches for a generalized line balancing problem
- Flow shop scheduling with heterogeneous workers
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
This page was built for publication: On solving the assembly line worker assignment and balancing problem via beam search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709148)
