Solutions to No-Wait Flow Shop Scheduling Problem Using the Flower Pollination Algorithm Based on the Hormone Modulation Mechanism
A flower pollination algorithm is proposed based on the hormone modulation mechanism (HMM-FPA) to solve the no-wait flow shop scheduling problem (NWFSP). This algorithm minimizes the maximum accomplished time. Random keys are encoded based on an ascending sequence of components to make the flower po...
Saved in:
Main Authors: | Chiwen Qu, Yanming Fu, Zhongjun Yi, Jun Tan |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2018-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2018/1973604 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
by: Qifang Luo, et al.
Published: (2014-01-01) -
Solving Constrained Flow-Shop Scheduling Problem through Multistage Fuzzy Binding Approach with Fuzzy Due Dates
by: Hamiden Abd El-Wahed Khalifa, et al.
Published: (2021-01-01) -
GPS Position Prediction Method Based on Chaotic Map-Based Flower Pollination Algorithm
by: Wanjun Yang, et al.
Published: (2021-01-01) -
A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem
by: Pisut Pongchairerks
Published: (2019-01-01) -
Ethnoecology of pollination and pollinators
by: Marie Roué, et al.
Published: (2015-06-01)