A memetic algorithm for the cost-oriented robotic assembly line balancing problem
From MaRDI portal
Publication:1654375
DOI10.1016/j.cor.2018.07.001zbMath1458.90237OpenAlexW2828915795WikidataQ129593061 ScholiaQ129593061MaRDI QIDQ1654375
Marcus Ritt, Jordi Pereira, Oscar C. Vásquez
Publication date: 8 August 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.001
Related Items (5)
A novel two-stage framework for reducing ergonomic risks of a mixed-model parallel U-shaped assembly-line ⋮ Approximation algorithms for simple assembly line balancing problems ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach ⋮ On the complexity of assembly line balancing problems
Uses Software
Cites Work
- Unnamed Item
- 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
- 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
- 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 dynamic programming based heuristic for the assembly line balancing problem
- Bin packing can be solved within 1+epsilon in linear time
- The multi-objective assembly line worker integration and balancing problem of type-2
- Exact and heuristic methods for solving the robotic assembly line balancing problem
- LP models for bin packing and cutting stock problems
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- A classification of assembly line balancing problems
- 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
- An linear programming based lower bound for the simple assembly line balancing problem
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- A genetic algorithm for robotic assembly line balancing
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
- Bi criteria flexible assembly line design problem with equipment decisions
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- A cutting plane approach for the single-product assembly system design problem
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
This page was built for publication: A memetic algorithm for the cost-oriented robotic assembly line balancing problem
