Comparison of Bioinspired Algorithms Applied to the Timetabling Problem in Sport
Author(s) -
Jesus Silva,
Danelys Cabrera,
José Maco,
Martín Villón,
Jesús García Guliany,
Alberto Roncallo,
Hugo Hernández Palma
Publication year - 2020
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2020.03.100
Subject(s) - computer science , scheduling (production processes) , job shop scheduling , class (philosophy) , subject (documents) , operations research , artificial intelligence , machine learning , algorithm , mathematical optimization , schedule , mathematics , world wide web , operating system
The problems of timetabling tasks or events, in general, are subject to sets of restrictions such as: creation of work roles, operation of different teams, operation personnel, among others. These types of problems are classified as NP class [1]. In this study, special attention is paid to the scheduling problem applied to sports clubs, for which different bioinspired algorithms are implemented and compared.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom