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...
Guardado en:
Autores principales: | Jianguo Zheng, Yilin Wang |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
MDPI AG
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/ad9d0f036e5846beadae23d328d661cf |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Optimization of No-Wait Flowshop Scheduling Problem in Bakery Production with Modified PSO, NEH and SA
por: Majharulislam Babor, et al.
Publicado: (2021) -
Programación de operaciones en dos etapas para un flowshop multiperíodo no tradicional
por: Juan Pablo Orejuela-Cabrera
Publicado: (2014) -
A Matheuristic Algorithm for the Multiple-Depot Vehicle and Crew Scheduling Problem
por: Emiliana Mara Lopes Simoes, et al.
Publicado: (2021) -
TDGVRPSTW of Fresh Agricultural Products Distribution: Considering Both Economic Cost and Environmental Cost
por: Daqing Wu, et al.
Publicado: (2021) -
Sequences of numbers via permutation polynomials over some finite rings
por: Vadiraja Bhatta,G. R., et al.
Publicado: (2020)