Solving Scheduling Problems with Genetic Algorithms using a Priority Encoding Scheme

Autor:	Subirats, J.L., Mesa, Héctor, Ortega-Zamorano, Francisco, Juárez, G.E., Jerez-Aragonés, José Manuel, Turias, Ignacio, Franco, Leonardo
Jazyk:	Spanish; Castilian
Rok vydání:	2017
Předmět:	Evolutionary and genetic algorithms Algoritmos computacionales Priority encoding scheme Job shop problems
Zdroj:	RIUMA. Repositorio Institucional de la Universidad de Málaga instname
Popis:	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. Universidad de Málaga.Campus de Excelencia Internacional Andalucía Tech.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::784e491f74fc78be3e25ed77e3db3052 http://hdl.handle.net/10630/14001 Zobrazit plný text záznamu