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...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Jianguo Zheng, Yilin Wang
Format: article
Langue:EN
Publié: MDPI AG 2021
Sujets:
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
Accès en ligne:https://doaj.org/article/ad9d0f036e5846beadae23d328d661cf
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!

Internet

https://doaj.org/article/ad9d0f036e5846beadae23d328d661cf

Documents similaires