Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing
From MaRDI portal
Publication:2256376
Recommendations
- A heuristic-based genetic algorithm for workload smoothing in assembly lines
- The application of a tabu search metaheuristic to the assembly line balancing problem
- Integrated procedure of balancing and sequencing for mixed-model assembly lines: a multi-objective evolutionary approach
- Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload
- A multi‐objective hybrid evolutionary search algorithm for parallel production line balancing problem including disassembly and assembly tasks
- Hybrid evolutionary multi-objective algorithms for integrating assembly sequence planning and assembly line balancing
- Multi-objective balancing of assembly lines by population heuristics
Cited in
(6)- Assembly line balancing: what happened in the last fifteen years?
- Multi-objective balancing of assembly lines by population heuristics
- A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis
- Workload smoothing in simple assembly line balancing
- The type E simple assembly line balancing problem: a mixed integer linear programming formulation
- SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing
This page was built for publication: Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256376)