Abstract
Obtaining the optimal schedule for permutation flow-shop scheduling problem (PFSP) is very important for manufacturing systems. A lot of approaches have been applied for PFSP to minimize makespan, but current algorithms cannot be solved to guarantee optimality. In this paper, based on Particle Swarm Optimization (PSO), a novel PSO (NPSO) is proposed for PFSP with the objective to minimize the makespan. To make original PSO suitable for discrete problems, some improvements and relative techniques for original PSO, such as, Particle representation based on PPS, different crossover and mutation of genetic algorithm (GA) used to avoid premature. Many classical problems have been used to evaluate the performance of the proposed NPSO. Through several comparisons between NPSO and PSO, we obtain that the NPSO is clearly more efficacious than original PSO for PFSP to minimize makespan.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Li, X., Yin, M.: A hybrid cuckoo search via Levy flights for the permutation flow shop scheduling problem. Int. J. Prod. Res. 51(16), 4732–4754 (2013)
Qiu, C.H., Wang, C.: An immune particle swarm optimization algorithm for solving permutation flowshop problem. Key Eng. Mater. 419, 133–136 (2010)
Zhanke, Yu., Mingfang, N., Zeyan W.: Improved branch and bound algorithm. J. Comput. Appl. (2011). s2
Leisten, R.: Flowshop sequencing problems with limited buffer storage. Int. J. Prod. Res. 28(11), 2085–2100 (1990)
Murata, T., Ishibuchi, H., Tanaka, H.: Genetic algorithms for flow-shop scheduling problems. Comput. Ind. Eng. 30(4), 1061–1071 (1996)
Liu, Y.-F., Liu, S.-Y.: A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Appl. Soft Comput. 13(3), 1459–1463 (2013)
Zhang, G., Gao, L., Shi, Y.: An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst. Appl. 38, 3563–3573 (2011)
Abdelmaguid, T.F.: A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times. Appl. Math. Comput. 260, 188–203 (2015)
Acknowledgment
This work was supported by: Science-Technology Program of the Higher Education Institutions of Shandong Province, China (No. J12LN22) and Research Award Foundation for Outstanding Young scientists of Shandong Province, China (No. BS2012DX041) and the National Natural Science Foundation of China (Grant No. 61472231).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Jia, Y., Qu, J., Wang, L. (2016). A Novel Particle Swarm Optimization Algorithm for Permutation Flow-Shop Scheduling Problem. In: Zu, Q., Hu, B. (eds) Human Centered Computing. HCC 2016. Lecture Notes in Computer Science(), vol 9567. Springer, Cham. https://doi.org/10.1007/978-3-319-31854-7_62
Download citation
DOI: https://doi.org/10.1007/978-3-319-31854-7_62
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31853-0
Online ISBN: 978-3-319-31854-7
eBook Packages: Computer ScienceComputer Science (R0)