Article
Counting and enumerating feasible rotating schedules by means of Gröbner bases
Author/s | Falcón Ganfornina, Raúl Manuel
![]() ![]() ![]() ![]() ![]() ![]() ![]() Barrena Algara, Eva Canca Ortiz, José David ![]() ![]() ![]() ![]() ![]() ![]() ![]() Laporte, Gilbert |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada I Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I |
Publication Date | 2016 |
Deposit Date | 2017-12-20 |
Published in |
|
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 ... 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. |
Funding agencies | Junta de Andalucía |
Project ID. | P09-TEP-5022
![]() |
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. |
Files | Size | Format | View | Description |
---|---|---|---|---|
MATCOM-D-14-00043.pdf | 172.7Kb | ![]() | View/ | |