Mathematical model and a variable neighborhood search algorithm for mixed-model robotic two-sided assembly line balancing problems with sequence-dependent setup times
From MaRDI portal
Publication:6173783
DOI10.1007/s11081-022-09718-3zbMath1520.90086OpenAlexW4226205868MaRDI QIDQ6173783
Publication date: 13 July 2023
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-022-09718-3
variable neighborhood searchsequence-dependent setup timesmixed-modeltwo-sided assembly line balancingrobotic
Cites Work
- An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines
- A mathematical model and a genetic algorithm for two-sided assembly line balancing
- The sequence-dependent assembly line balancing problem
- Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- Developing optimization \& robust models for a mixed-model assembly line balancing problem with semi-automated operations
- Metaheuristic algorithms for balancing robotic assembly lines with sequence-dependent robot setup times
- A station-oriented enumerative algorithm for two-sided assembly line balancing
- Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
- A genetic algorithm for robotic assembly line balancing
- Balancing two-sided assembly lines with sequence-dependent setup times
- Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition
- Variable neighborhood search: Principles and applications
This page was built for publication: Mathematical model and a variable neighborhood search algorithm for mixed-model robotic two-sided assembly line balancing problems with sequence-dependent setup times
