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

Raúl Falcón, Eva Barrena, David Canca, Gilbert Laporte

Research output: Contribution to journalArticlepeer-review

7 Citations (SciVal)


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 languageEnglish
Pages (from-to)139-151
Number of pages13
JournalMathematics and Computers in Simulation
Publication statusPublished - Jul 2016


  • Boolean ideal
  • Gröbner basis
  • Rotating schedule

ASJC Scopus subject areas

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


Dive into the research topics of 'Counting and enumerating feasible rotating schedules by means of Gröbner bases'. Together they form a unique fingerprint.

Cite this