Abstract
In this paper, we tackle the job shop scheduling problem (JSP) with skilled operators (JSPSO). This is an extension of the classic JSP in which the processing of a task in a machine has to be assisted by one operator skilled for the task. The JSPSO is a challenging problem because of its high complexity and because it models many real-life situations in production environments. To solve the JSPSO, we propose a genetic algorithm that incorporates a new coding schema as well as genetic operators tailored to dealing with skilled operators. This algorithm is analyzed and evaluated over a benchmark set designed from conventional JSP instances. The results of the experimental study show that the proposed algorithm performs well and at the same time they allowed us to gain insight into the problem characteristics and to draw ideas for further improvements.
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
Agnetis, A., Flamini, M., Nicosia, G., Pacifici, A.: A job-shop problem with one additional resource type. J. Scheduling 14(3), 225–237 (2011)
Agnetis, A., Murgia, G., Sbrilli, S.: A job shop scheduling problem with human operators in handicraft production. International Journal of Production Research 52(13), 3820–3831 (2014)
Bierwirth, C.: A generalized permutation approach to job shop scheduling with genetic algorithms. OR Spectrum 17, 87–92 (1995)
Dell’ Amico, M., Trubian, M.: Applying tabu search to the job-shop scheduling problem. Annals of Operational Research 41, 231–252 (1993)
García, S., Fernández, A., Luengo, J., Herrera, F.: Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power. Information Sciences 180, 2044–2064 (2010)
Mencía, R., Sierra, M.R., Mencía, C., Varela, R.: A genetic algorithm for job-shop scheduling with operators enhanced by weak lamarckian evolution and search space narrowing. Natural Computing 13(2), 179–192 (2014)
Van Laarhoven, P., Aarts, E., Lenstra, K.: Job shop scheduling by simulated annealing. Operations Research 40, 113–125 (1992)
Varela, R., Serrano, D., Sierra, M.: New codification schemas for scheduling with genetic algorithms. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 11–20. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Mencía, R., Sierra, M.R., Varela, R. (2015). Genetic Algorithm for the Job-Shop Scheduling with Skilled Operators. In: Ferrández Vicente, J., Álvarez-Sánchez, J., de la Paz López, F., Toledo-Moreo, F., Adeli, H. (eds) Bioinspired Computation in Artificial Systems. IWINAC 2015. Lecture Notes in Computer Science(), vol 9108. Springer, Cham. https://doi.org/10.1007/978-3-319-18833-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-18833-1_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18832-4
Online ISBN: 978-3-319-18833-1
eBook Packages: Computer ScienceComputer Science (R0)