Ponencia
Designing rotating schedules by using Gröbner bases
Autor/es | Falcón Ganfornina, Raúl Manuel
Canca Ortiz, José David Barrena Algara, Eva |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I |
Fecha de publicación | 2013 |
Fecha de depósito | 2018-01-19 |
Publicado en |
|
Resumen | In the current paper, we deal with the problem of designing rotating schedules from an algebraic computational approach. Specifically, we determine a set of Boolean polynomials whose zeros can be uniquely ... In the current paper, we deal with the problem of designing rotating schedules from 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 and with the different constraints which are usually imposed to them.These polynomials constitute zero-dimensional radical ideals, whose reduced Gröbner bases can be computed to determine explicitly the set of rotating schedules which satisfy each constraint and hence, making possible to analyze their influence in the final pattern. Finally, we use this polynomial method to classify and characterize the set of rotating schedules related to a given number of shifts and work teams. |
Cita | Falcón Ganfornina, R.M., Canca Ortiz, J.D. y Barrena Algara, E. (2013). Designing rotating schedules by using Gröbner bases. En Applications of Computer Algebra, Málaga. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Designing-rotating-schedules-b ... | 87.95Kb | [PDF] | Ver/ | |