Abstract
The optimization of job-shop scheduling is very important because of its theoretical and practical significance. This paper proposes an efficient scheduling method based on artificial immune systems. In the proposed method, the initial population is generated by a proposed scheduling initialization algorithm based on the G&T algorithm, and the models of the vaccination and receptor editing are designed to improve the immune performance. The approach is tested on a set of standard instances taken from the existing standard library. The simulation results validate the effectiveness of the proposed algorithm.
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
Beasley, J.E.: OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operations Research Society 41(11), 1069–1072 (1990)
Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C.: 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
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ge, HW., Sun, L., Liang, YC. (2005). Solving Job-Shop Scheduling Problems by a Novel Artificial Immune System. In: Zhang, S., Jarvis, R. (eds) AI 2005: Advances in Artificial Intelligence. AI 2005. Lecture Notes in Computer Science(), vol 3809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11589990_92
Download citation
DOI: https://doi.org/10.1007/11589990_92
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30462-3
Online ISBN: 978-3-540-31652-7
eBook Packages: Computer ScienceComputer Science (R0)