### 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.

Original language | English |
---|---|

Pages (from-to) | 139-151 |

Number of pages | 13 |

Journal | Mathematics and Computers in Simulation |

Volume | 125 |

DOIs | |

Publication status | Published - Jul 2016 |

### Keywords

- Boolean ideal
- Gröbner basis
- Rotating schedule

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)
- Numerical Analysis
- Modelling and Simulation
- Applied Mathematics

## Cite this

Falcón, R., Barrena, E., Canca, D., & Laporte, G. (2016). Counting and enumerating feasible rotating schedules by means of Gröbner bases.

*Mathematics and Computers in Simulation*,*125*, 139-151. https://doi.org/10.1016/j.matcom.2014.12.002