A memetic algorithm for the cost-oriented robotic assembly line balancing problem
From MaRDI portal
Publication:1654375
DOI10.1016/J.COR.2018.07.001zbMATH Open1458.90237OpenAlexW2828915795WikidataQ129593061 ScholiaQ129593061MaRDI QIDQ1654375FDOQ1654375
Authors: Jordi Pereira, Marcus Ritt, 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
Recommendations
- Exact and heuristic methods for solving the robotic assembly line balancing problem
- A genetic algorithm for robotic assembly line balancing
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- scientific article; zbMATH DE number 1264431
- Bi criteria flexible assembly line design problem with equipment decisions
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- A genetic algorithm for robotic assembly line balancing
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Bin packing can be solved within 1+epsilon in linear time
- LP models for bin packing and cutting stock problems
- 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
- 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
- An linear programming based lower bound for the simple assembly line balancing problem
- Procedures for the time and space constrained assembly line balancing problem
- A dynamic programming based heuristic for the assembly line balancing problem
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- 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
- On solving the assembly line worker assignment and balancing problem via beam search
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Bi criteria flexible assembly line design problem with equipment decisions
- Exact and heuristic methods for solving the robotic assembly line balancing problem
- A cutting plane approach for the single-product assembly system design problem
- The multi-objective assembly line worker integration and balancing problem of type-2
Cited In (6)
- 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
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach
- Assembly line balancing: what happened in the last fifteen years?
- A genetic algorithm for robotic assembly line balancing
- On the complexity of assembly line balancing problems
Uses Software
This page was built for publication: A memetic algorithm for the cost-oriented robotic assembly line balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1654375)
