A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem

A Hybrid Bat Algorithm for Solving the Three-Stage Distributed Assembly Permutation Flowshop Scheduling Problem

In this paper, a hybrid bat optimization algorithm based on variable neighbourhood structure and two learning strategies is proposed to solve a three-stage distributed assembly permutation flowshop scheduling problem to minimize the makespan. The algorithm is firstly designed to increase the populat...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Jianguo Zheng, Yilin Wang
Formato: article
Lenguaje:EN
Publicado: MDPI AG 2021
Materias:
hybrid bat algorithm
optimization problem
the distributed assembly permutation flowshop scheduling problem
variable neighborhood descent
Technology
T
Engineering (General). Civil engineering (General)
TA1-2040
Biology (General)
QH301-705.5
Physics
QC1-999
Chemistry
QD1-999
Acceso en línea:https://doaj.org/article/ad9d0f036e5846beadae23d328d661cf
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Internet

https://doaj.org/article/ad9d0f036e5846beadae23d328d661cf

Ejemplares similares