2026-05-28T13:39:55Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/140012026-02-03T12:30:53Zcom_10630_2254col_10630_37959

Subirats, J.L. Mesa, Héctor Ortega-Zamorano, Francisco Juárez, G.E. Jerez-Aragonés, José Manuel Turias, Ignacio Franco, Leonardo 2017-06-26T11:44:03Z 2017-06-26T11:44:03Z 2017-06-26 http://hdl.handle.net/10630/14001 http://orcid.org/0000-0003-0012-5914 Scheduling problems are very hard computational tasks with several applications in multitude of domains. In this work we solve a practical problem motivated by a real industry situation, in which we apply a genetic algorithm for finding an acceptable solution in a very short time interval. The main novelty introduced in this work is the use of a priority based chromosome codification that determines the precedence of a task with respect to other ones, permitting to introduce in a very simple way all problem constraints, including setup costs and workforce availability. Results show the suitability of the approach, obtaining real time solutions for tasks with up to 50 products. spa open access by-nc-nd Algoritmos computacionales Solving Scheduling Problems with Genetic Algorithms using a Priority Encoding Scheme conference output