Abstract
A computationally effective algorithm of combining PSO with AIS for solving the minimum makespan problem of job shop scheduling is proposed. In the particle swarm system, a novel concept for the distance and velocity of a particle is presented to pave the way for the job-shop scheduling problem. In the artificial immune system, the models of vaccination and receptor editing are designed to improve the immune performance. The proposed algorithm effectively exploits the capabilities of distributed and parallel computing of swarm intelligence approaches. The algorithm is examined using a set of benchmark instances with various sizes and levels of hardness and compared with other approaches reported in some existing literatures. The computational results validate the effectiveness of the proposed approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Heilmann, R.: A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. European Journal of Operational Research 144(2), 348–365 (2003)
Lorigeon, T.: A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint. Journal of the Operational Research Society 53(11), 1239–1246 (2002)
Canbolat, Y.B., Gundogar, E.: Fuzzy priority rule for job shop scheduling. Journal of intelligent manufacturing 15(4), 527–533 (2004)
Huang, W.Q., Yin, A.H.: An improved shifting bottleneck procedure for the job shop scheduling problem. Computers & Operations Research 31(12), 2093–2110 (2004)
Geyik, F., Cedimoglu, I.H.: The strategies and parameters of tabu search for job-shop scheduling. Journal of intelligent manufacturing 15(4), 439–448 (2004)
Fayad, C., Petrovic, S.: A fuzzy genetic algorithm for real-world job shop scheduling. In: Ali, M., Esposito, F. (eds.) IEA/AIE 2005. LNCS (LNAI), vol. 3533, pp. 524–533. Springer, Heidelberg (2005)
Suresh, R.K., Mohanasundaram, K.M.: Pareto archived simulated annealing for job shop scheduling with multiple objectives. International Journal of Advanced Manufacturing Technology 29(1-2), 184–196 (2006)
Coello, C.A.C., Rivera, D.C., Cortes, N.C.: Use of an artificial immune system for job shop scheduling. In: Timmis, J., Bentley, P.J., Hart, E. (eds.) ICARIS 2003. LNCS, vol. 2787, pp. 1–10. Springer, Heidelberg (2003)
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, Perth, Australia, pp. 1942–1948. IEEE Service Center, Piscataway (1995)
Beasley, J.E.: OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operations Research Society 41(11), 1069–1072 (1990)
Goncalves, J.F., Mendes, J.J.D.M., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research 167(1), 77–95 (2005)
Ombuki, B.M., Ventresca, M.: Local search genetic algorithms for the job shop scheduling problem. Applied Intelligence 21(1), 99–109 (2004)
Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing 29(4), 393–430 (2003)
Binato, S., et al.: A GRASP for Job Shop Scheduling. In: Essays and Surveys in Metaheuristics, pp. 59–80. Kluwer Academic Publishers, Boston (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hong-Wei, G., Wen-Li, D., Feng, Q., Lu, W. (2007). An Intelligent Hybrid Algorithm for Job-Shop Scheduling Based on Particle Swarm Optimization and Artificial Immune System. In: Melin, P., Castillo, O., RamÃrez, E.G., Kacprzyk, J., Pedrycz, W. (eds) Analysis and Design of Intelligent Systems using Soft Computing Techniques. Advances in Soft Computing, vol 41. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72432-2_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-72432-2_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72431-5
Online ISBN: 978-3-540-72432-2
eBook Packages: EngineeringEngineering (R0)