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

DOI10.1016/j.matcom.2014.12.002OpenAlexW2062348420MaRDI QIDQ2228806

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

Publication date: 19 February 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle/11441/67846

zbMATH Keywords

Gröbner basisBoolean idealrotating schedule

Mathematics Subject Classification ID

Computer science (68-XX) Commutative algebra (13-XX)

Related Items

A computer approach to overtaking station track layout diagram design using graphs. An alternative track diagram proposal for these stations ⋮ Instance space analysis for a personnel scheduling problem

Uses Software

• slimgb
• pls.lib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representing and solving finite-domain constraint problems using systems of polynomials
• The set of autotopisms of partial Latin squares
• Personnel scheduling: models and complexity
• Nullstellensätze for zero-dimensional Gröbner bases
• Rotating schedules
• Solving zero-dimensional algebraic systems
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• On decomposing systems of polynomial equations with finitely many solutions
• Efficient generation of rotating workforce schedules
• Survey, categorization, and comparison of recent tour scheduling literature
• On the complexity of manpower shift scheduling
• Slimgb: Gröbner bases with slim polynomials
• Personnel scheduling: a literature review
• Workforce scheduling with multiple objectives
• Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\)
• SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING
• The art and science of designing rotating schedules
• On Manpower Scheduling Algorithms
• Combinatorial Nullstellensatz
• A Multiple-Shift Workforce Scheduling Model Under the 4-Day Workweek with Weekday and Weekend Labour Demands
• A general multi-shift scheduling system
• COMBINATORIAL APPROACHES FOR HARD PROBLEMS IN MANPOWER SCHEDULING
• A Three-Day Workweek Multiple-Shift Scheduling Model
• Counting Solutions of Knapsack Constraints