dc.creator | Falcón Ganfornina, Raúl Manuel | es |
dc.creator | Barrena Algara, Eva | es |
dc.creator | Canca Ortiz, José David | es |
dc.creator | Laporte, Gilbert | es |
dc.date.accessioned | 2017-12-20T10:21:02Z | |
dc.date.available | 2017-12-20T10:21:02Z | |
dc.date.issued | 2016 | |
dc.identifier.citation | Falcón Ganfornina, R.M., Barrena Algara, E., Canca Ortiz, J.D. y Laporte, G. (2016). Counting and enumerating feasible rotating schedules by means of Gröbner bases. Mathematics and Computers in Simulation, 125, 139-151. | |
dc.identifier.issn | 0378-4754 | es |
dc.identifier.uri | http://hdl.handle.net/11441/67846 | |
dc.description.abstract | This paper deals with the problem of designing and analyzing rotating schedules with an algebraic computational approach. Specifically, we determine a set of Boolean polynomials whose zeros can be uniquely identified with the set of rotating schedules related to a given workload matrix subject to standard constraints. These polynomials constitute zero-dimensional radical ideals, whose reduced Gröbner bases can be computed to count and even enumerate the set of rotating schedules that satisfy the desired set of constraints. Thereby, it enables to analyze the influence of each constraint in the same. | es |
dc.description.sponsorship | Junta de Andalucía P09-TEP-5022 | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Elsevier | es |
dc.relation.ispartof | Mathematics and Computers in Simulation, 125, 139-151. | |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.title | Counting and enumerating feasible rotating schedules by means of Gröbner bases | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada I | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I | es |
dc.relation.projectID | P09-TEP-5022 | es |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0378475414003292 | es |
dc.identifier.doi | 10.1016/j.matcom.2014.12.002 | es |
dc.contributor.group | Universidad de Sevilla. FQM016: Códigos, diseños, criptografía y optimización | es |
idus.format.extent | 13 p. | es |
dc.journaltitle | Mathematics and Computers in Simulation | es |
dc.publication.issue | 125 | es |
dc.publication.initialPage | 139 | es |
dc.publication.endPage | 151 | es |
dc.contributor.funder | Junta de Andalucía | |