Considering the advantages of the partcile swarm optimization (PSO), this paper probes deep into the improvement of the traditional PSO algorithm and its application in leather workshop scheduling. Firstly, the online scheduling of no-wait supply chain was described in details, while improving the PSO algorithm. On this basis, the author proposed an online no-wait scheduling algorithm based on the improved PSO for leather workshop supply chain. After that, the proposed algorithm was used to schedule an example leather workshop. The results show that our algorithm can find the optimal processing plan with a small swarm and through a limited number of iterations, despite the huge amount of orders.
particle swarm optimization (PSO), supply chain, leather workshop, no-wait scheduling
Cagnina L., Esquivel S., Gallard R. (2004). Particle swarm optimization for sequencing problems: A case study. Congress on Evolutionary Computation, pp. 536-540. https://doi.org/10.1109/CEC.2004.1330903
Eberhart R. C., Kennedy J. (1995). A new optimizer using particle swarm theory. International Symposium on Micromachine and Human Science, pp. 39-43. https://doi.org/10.1109/MHS.1995.494215
Gu F., Chen S. P., Lu B. Y., Gu C. S. (2005). Particle swarm optimization for flexible job shop scheduling. System Engineering, Vol. 23, No. 9, pp. 20-23. https://doi.org/10.3969/j.issn.1001-4098.2005.09.006
Kennedy J., Eberhart R. C. (1995). Particle swarm optimization. Proc. IEEE Intl. Conf. on Neural Networks, IEEE Service Center, NJ, Vol. 4, No. 8, pp. 1942-1948. https://doi.org/10.1109/ICNN.1995.488968
Liao C. J., Tseng C. T., Luarn P. (2007). A discrete version of particle swarm optimization for fiowshop scheduling problems. Computers & Operations Research, Vol. 34, No. 1, pp. 3099-3111. https://doi.org/10.1016/j.cor.2005.11.017
Pan Q. K., Tasgetiren M. F., Liang Y. C. (2005). A discrete panicle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion. International Workshop on UK Planning and Scheduling Special Interest Group, pp. 31-41.
Pan Q. K., Wang W. H., Zhu J. Y. (2007). A discrete particle swarm optimization algorithm for solving no-wait flow shop scheduling problem. Computer Integrated Manufacturing System, Vol. 13, No. 6, pp. 1127-1130. https://doi.org/10.1016/j.cor.2006.12.030
Proth J. M. (2007). Scheduling: New trends in industrial environment. Annual Reviews in Control, Vol. 31, No. 11, pp. 157-166. https://doi.org/10.1016/j.arcontrol.2007.03.005
Schuster C. J., Framinan J. M. (2003). Approximative procedures for no-wait job shop scheduling. Operations Research Letters, Vol. 31, No. 7, pp. 308-318. https://doi.org/10.1016/S0167-6377(03)00005-1
Tasgetiren M. F., Liang Y. C., Sevkli M. (2004). Particle swarm optimization algorithm for makespan and maximum lateness minimization in perrnutation flowshop sequencing problem. International Symposium on Intelligent Manufacturing Systems, pp. 431-441. https://doi.org/10.1109/CEC.2004.1331062
Tasgetiren M. F., Liang Y. C., Sevkli M. (2007). A particle swarm optimization algorithm for makespan and total flowtime minimization in permutation flowshop sequencing problem. European Journal of Operational Research, Vol. 177, No. 6, pp. 1930-1947. https://doi.org/10.1016/j.ejor.2005.12.024
Tasgetiren M. F., Sevkli M., Liang Y. C. (2004). Particle swarm optimization algorithm for single machine total weighted tardiness problem. IEEE Congress on Evolutionary Computation, pp. 1412-1419. https://doi.org/10.1109/CEC.2004.1331062
Xia W. J., Wu Z. M., Zhang W. (2004). A New hybrid optimimtion algorithm for the job-shop scheduling problem. American Control Conference, pp. 5552-5557.
Zheng Y., Wu B. (2011). The subject-based simulation and cluster intelligence studied by birds and ants. Microcomputer World, Vol. 8, No. 1, pp. 7-13.