Abstract
The Permutation Flow Shop Scheduling Problem (PFSP) is a typical example in Production Scheduling, which has attracted many researchers’ attention. This paper takes to the advantage of the swarm characteristic of Particle Swarm optimization (PSO) algorithm to find the best particle in the solution space. The objective is to minimize the makespan. Firstly, the initial solution of the algorithm is generated by the famous heuristic NEH algorithm. The NEH algorithm was used to initialize the particle of global extreme values. Secondly, we take some optimized strategy to set the parameters, acceleration constant and nonlinear inertia weight strategy which based on random self-adaptively by means of chaos method for setting parameters. These optimized methods can avoid algorithm to be trapped in local optimum. At last, simulated results demonstrate that the hybrid PSO method is feasible and effective for the PFSP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Wu, C., Gu, X.: A genetic algorithm for flow shop scheduling with fuzzy processing time and due date. In: Proceedings of 5th World Congress on Control and Automation, pp. 2983–2942 (June 2004)
Kalir, A.A., Sarin, S.C.: A near-optimal heuristic for the sequence problem in multiple-batch flow –shops with small equal stublots. Omega 29, 577–584 (2001)
Dou, J., Li, J.: Adiscrete particle swarm algorithm foe makespan minimization in the permutation flowsshop scheduling problem. In: Proc. IEEE International Conference on Evolutionary Computation, pp. 69–73 (2013)
Fatih Tasgetiren, M., Sevkli, M., Liang, Y.-C., Gencyilmaz, G.: Particle swarm optimization algorithm for permutation flowshop sequencing problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 382–389. Springer, Heidelberg (2004)
Han, Y.-Y., Duan, J.-H., Zhang, M.: Apply the discrete artifical bee colony algorithm to the blocking flow shop problem with makespan criterion. In: Chinese Control and Decision Conference (CCDC), pp. 2135–2139 (2011)
Dong, J.-M., Hu, J.-L., Chen, Y.: Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage. Appl. Math. J. Chinese. Univ., 358–368 (2013)
Duan, J.-H., Zhang, M., Qiao, G.-Y., Li, J.-Q.: AGenetic algorithm for permutation flowshop scheduling with total flowtime criterion. In: Chinese Control and Decision Conference (CCDC), pp. 1514–1518 (2011)
Zeng, C., Tang, J., Zhu, H.: Two heuristic algorithms of job scheduling problem with inter-cell production mode in hybrid operations of machining. In: Chinese Control and Decision Conference (CCDC), pp. 1282–1285 (2013)
Wisittipanich, W., Kachitvichyanukul, V.: Differential evolution algorithm for makespan minimization in flexible job shop scheduling problem. In: Proceeding of 12th Asia Pacific Industrial Engineering and Management Systems Conference, pp. 104–110 (2011)
Oguz, C., Ercan, M.: A genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks. Journal of Scheduling. 8(4), 323–351 (2004)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE Conference on Neural Network, pp. 1942–1948. IEEE Press, Piscataway (1995)
Chang, J., An, F., Su, P.: A quantum-PSO algorithm for no-wait flow shop scheduling problem. In: Chinese Control and Decision Conference (CCDC), pp. 179–184 (2010)
Tasgetiren, M.F., Sevkli, M., Liang, Y.C., et al.: Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of IEEE Congress on Evolutionary Computation, vol. 2, pp. 1412–1419. IEEE, Washington, D.C. (2004)
Liiu, B., Wang, L., Jiny, I.: An Effective Hybrid PSO-based Algorithm for Flow Shop Scheduling to Minimize Makespan. Chaos, Solitions & Fractals 35(5), 851–861 (2008)
Wang, X., Tang, L.: An improved particle swarm optimization for permutation flowshop scheduling problem with total flowtime criterion. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010, Part I. LNCS, vol. 6145, pp. 144–151. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, L., Qu, J., Zheng, Y. (2015). A Hybrid Particle Swarm Optimization Method for Permutation Flow Shop Scheduling Problem. In: Zu, Q., Hu, B., Gu, N., Seng, S. (eds) Human Centered Computing. HCC 2014. Lecture Notes in Computer Science(), vol 8944. Springer, Cham. https://doi.org/10.1007/978-3-319-15554-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-319-15554-8_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15553-1
Online ISBN: 978-3-319-15554-8
eBook Packages: Computer ScienceComputer Science (R0)