Repositorio de producción científica de la Universidad de Sevilla

Counting and enumerating feasible rotating schedules by means of Gröbner bases

Opened Access Counting and enumerating feasible rotating schedules by means of Gröbner bases

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Falcón Ganfornina, Raúl Manuel
Barrena Algara, Eva
Canca Ortiz, José David
Laporte, Gilbert
Departamento: Universidad de Sevilla. Departamento de Matemática Aplicada I
Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I
Fecha: 2016
Publicado en: Mathematics and Computers in Simulation, 125, 139-151.
Tipo de documento: Artículo
Resumen: 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.
Cita: 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.
Tamaño: 172.7Kb
Formato: PDF

URI: http://hdl.handle.net/11441/67846

DOI: 10.1016/j.matcom.2014.12.002

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Atribución-NoComercial-SinDerivar 4.0 Internacional

Este registro aparece en las siguientes colecciones