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...
Saved in:
Main Authors: | Jianguo Zheng, Yilin Wang |
---|---|
Format: | article |
Language: | EN |
Published: |
MDPI AG
2021
|
Subjects: | |
Online Access: | https://doaj.org/article/ad9d0f036e5846beadae23d328d661cf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimization of No-Wait Flowshop Scheduling Problem in Bakery Production with Modified PSO, NEH and SA
by: Majharulislam Babor, et al.
Published: (2021) -
Programación de operaciones en dos etapas para un flowshop multiperíodo no tradicional
by: Juan Pablo Orejuela-Cabrera
Published: (2014) -
A Matheuristic Algorithm for the Multiple-Depot Vehicle and Crew Scheduling Problem
by: Emiliana Mara Lopes Simoes, et al.
Published: (2021) -
TDGVRPSTW of Fresh Agricultural Products Distribution: Considering Both Economic Cost and Environmental Cost
by: Daqing Wu, et al.
Published: (2021) -
Sequences of numbers via permutation polynomials over some finite rings
by: Vadiraja Bhatta,G. R., et al.
Published: (2020)