A hybrid biogeography-based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem

2019 ◽  
Vol 126 ◽  
pp. 321-339 ◽  
Author(s):  
Fuqing Zhao ◽  
Shuo Qin ◽  
Yi Zhang ◽  
Weimin Ma ◽  
Chuck Zhang ◽  
...  
Keyword(s):  
Variable Neighborhood Search ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Search Mechanism ◽  
No Wait

scholarly journals Solutions to No-Wait Flow Shop Scheduling Problem Using the Flower Pollination Algorithm Based on the Hormone Modulation Mechanism

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-18 ◽  
Author(s):  
Chiwen Qu ◽  
Yanming Fu ◽  
Zhongjun Yi ◽  
Jun Tan
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Neighborhood Search ◽  
Flower Pollination Algorithm ◽  
Work Piece ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Flower Pollination ◽  
Hormone Modulation ◽  
No Wait

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 pollination algorithm (FPA) suitable for the no-wait flow shop scheduling problem. The hormone modulation factor is introduced to strengthen information sharing among the flowers and improve FPA cross-pollination to enhance the algorithm global search performance. A variable neighborhood search strategy based on dynamic self-adaptive variable work piece blocks is constructed to improve the local search quality. Three common benchmark instances are applied to test the proposed algorithm. The result verifies that this algorithm is effective.

Sign in / Sign up

Export Citation Format

Share Document