Exact and heuristic methods for solving the robotic assembly line balancing problem
From MaRDI portal
Publication:1754736
Recommendations
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- An efficient heuristic method for the simple assembly line balancing problem
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- A strong cutting plane algorithm for the robotic assembly line balancing problem
- Optimal method of robotic assemble line balancing considering changeover time
- A dynamic programming based heuristic for the assembly line balancing problem
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
Cites work
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- A classification of assembly line balancing problems
- A decomposition theorem for partially ordered sets
- 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 Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- A survey on problems and methods in generalized assembly line balancing
- Algorithm for tool placement in an automatic tool change magazine
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- 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
- Autonomous fruit picking machine: a robotic apple harvester
- Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
- On solving the assembly line worker assignment and balancing problem via beam search
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
Cited in
(21)- Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem
- Balancing a robotic spot welding manufacturing line: an industrial case study
- Assembly line balancing: what happened in the last fifteen years?
- Branch, bound and remember algorithm for two-sided assembly line balancing problem
- Solving a large cutting problem in the glass manufacturing industry
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A genetic algorithm for robotic assembly line balancing
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
- A strong cutting plane algorithm for the robotic assembly line balancing problem
- Optimal method of robotic assemble line balancing considering changeover time
- Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems
- Exact and heuristic methods for a workload allocation problem with chain precedence constraints
- Mathematical model and a variable neighborhood search algorithm for mixed-model robotic two-sided assembly line balancing problems with sequence-dependent setup times
- Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm
- Model and metaheuristic for human-robot collaboration assembly line worker assignment and balancing problem
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
- Bi-objective minimization of energy consumption and cycle time for the robotic assembly line balancing problem: pseudo-polynomial case and reduced search space metaheuristic
- Flight test scheduling: a generic model, lower bounds, and iterated local search
- Minimizing cycle time and energy consumption in robotic assembly line: a multi-objective metaheuristic
- A novel two-stage framework for reducing ergonomic risks of a mixed-model parallel U-shaped assembly-line
This page was built for publication: Exact and heuristic methods for solving the robotic assembly line balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754736)