Abstract
We face the job-shop scheduling problem with operators. To solve this problem we propose a new approach that combines a genetic algorithm with a new schedule generation scheme. We report results from an experimental study across conventional benchmark instances showing that our approach outperforms some current state-of-the-art methods.
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.
References
Agnetis, A., Flamini, M., Nicosia, G., Pacifici, A.: A job-shop problem with one additional resource type. Journal of Scheduling (2010), doi:10.1007/s10951-010-0162-4
Artigues, C., Lopez, P., Ayache, P.: Schedule generation schemes for the job shop problem with sequence-dependent setup times: Dominance properties and computational analysis. Annals of Operations Research 138, 21–52 (2005)
Bierwirth, C.: A generalized permutation approach to jobshop scheduling with genetic algorithms. OR Spectrum 17, 87–92 (1995)
Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics 49, 107–127 (1994)
Giffler, B., Thompson, G.L.: Algorithms for solving production scheduling problems. Operations Research 8, 487–503 (1960)
González, M.A., Vela, C.R., Varela, R.: A new hybrid genetic algorithm for the job shop scheduling problem with setup times. In: Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008). AAAI Press, Sidney (2008)
González Rodríguez, I., Vela, C.R., Puente, J., Varela, R.: A new local search for the job shop problem with uncertain durations. In: Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008). AAAI Press, Sidney (2008)
Mattfeld, D.C.: Evolutionary Search and the Job Shop Investigations on Genetic Algorithms for Production Scheduling. Springer, Heidelberg (1995)
Sierra, M.R., Varela, R.: Pruning by dominance in best-first search for the job shop scheduling problem with total flow time. Journal of Intelligent Manufacturing 21(1), 111–119 (2010)
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
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mencía, R., Sierra, M.R., Mencía, C., Varela, R. (2011). Genetic Algorithm for Job-Shop Scheduling with Operators. In: Ferrández, J.M., Álvarez Sánchez, J.R., de la Paz, F., Toledo, F.J. (eds) New Challenges on Bioinspired Applications. IWINAC 2011. Lecture Notes in Computer Science, vol 6687. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21326-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-21326-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21325-0
Online ISBN: 978-3-642-21326-7
eBook Packages: Computer ScienceComputer Science (R0)