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

Chiwen Qu, Yanming Fu, Zhongjun Yi and Jun Tan

Complexity, 2018, vol. 2018, 1-18

Abstract:

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.

Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2018/1973604.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2018/1973604.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:1973604

DOI: 10.1155/2018/1973604

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().