Hybrid flow shop scheduling problems using improved fireworks algorithm for permutation

Pang, X., Xue, H., Tseng, M.-L., Lim, M.K. and Liu, K. (2020) Hybrid flow shop scheduling problems using improved fireworks algorithm for permutation. Applied Sciences, 10(3), 1174. (doi: 10.3390/app10031174)

Abstract

Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy. The permutation flow shop scheduling problem and hybrid flow shop scheduling problems are important production scheduling types, which widely exist in industrial production fields. This study aimed to acquire the best scheduling strategy for making production plans. An improved fireworks algorithm is proposed to minimize the makespan in the proposed strategies. The proposed improved fireworks algorithm is compared with the fireworks algorithm, and the improvement strategies include the following: (1) A nonlinear radius is introduced and the minimum explosion amplitude is checked to avoid the waste of optimal fireworks; (2) The original Gaussian mutation operator is replaced by a hybrid operator that combines Cauchy and Gaussian mutation to improve the search ability; and (3) An elite group selection strategy is adopted to reduce the computing costs. Two instances from the permutation flow shop scheduling problem and hybrid flow shop scheduling problems were used to evaluate the improved fireworks algorithm’s performance, and the computational results demonstrate the improved fireworks algorithm’s superiority.

• Item Type: Articles
• Additional Information: This study was partially funded by the project of ministry of science and technology, grant number MOST 108-2221-E-468 -004 -MY2.
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Lim, Professor Ming
• Authors: Pang, X., Xue, H., Tseng, M.-L., Lim, M.K., and Liu, K.
• College/School: College of Social Sciences > Adam Smith Business School > Management
• Journal Name: Applied Sciences
• Publisher: MDPI
• ISSN: 2076-3417
• ISSN (Online): 2076-3417
• Copyright Holders: Copyright © 2020 by the authors
• First Published: First published in Applied Sciences 10(3):1174
• Publisher Policy: Reproduced under a Creative Commons licence