Exact and heuristic methods for solving the robotic assembly line balancing problem
From MaRDI portal
Publication:1754736
DOI10.1016/j.ejor.2018.03.011zbMath1403.90652OpenAlexW2791804318MaRDI QIDQ1754736
Leonardo Borba, Marcus Ritt, Cristóbal Miralles
Publication date: 31 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/120233
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (9)
A novel two-stage framework for reducing ergonomic risks of a mixed-model parallel U-shaped assembly-line ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ 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 ⋮ Branch, bound and remember algorithm for two-sided assembly line balancing problem ⋮ Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem ⋮ Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ Exact and heuristic methods for a workload allocation problem with chain precedence constraints
Uses Software
Cites Work
- Unnamed Item
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- 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
- On solving the assembly line worker assignment and balancing problem via beam search
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- 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 survey on problems and methods in generalized assembly line balancing
- A genetic algorithm for robotic assembly line balancing
- A decomposition theorem for partially ordered sets
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Algorithm for tool placement in an automatic tool change magazine
This page was built for publication: Exact and heuristic methods for solving the robotic assembly line balancing problem
