Skip to main content

CROSS cyclic resource-constrained scheduling solver

TitleCROSS cyclic resource-constrained scheduling solver
Publication TypeJournal Article
Year of Publication2014
AuthorsBonfietti, A., M. Lombardi, L. Benini, and M. Milano
JournalArtificial Intelligence
Volume206
Pagination25–52
KeywordsConstraint Programming, Cumulative constraint, Cyclic scheduling problem, Filtering algorithm
Abstract

Cyclic scheduling problems consist in ordering a set of activities executed indefinitely over time in a periodic fashion, subject to precedence and resource constraints. This class of problems has many applications in manufacturing, embedded systems and compiler design, production and chemical systems. This paper proposes a Constraint Programming approach for cyclic scheduling problems, based on modular arithmetic: in particular, we introduce a modular precedence constraint and a global cumulative constraint along with their filtering algorithms. We discuss two possible formulations. The first one (referred to as CROSS) models a pure cyclic scheduling problem and makes use of both our novel constraints. The second formulation (referred to as CROSS⁎) introduces a restrictive assumption to enable the use of classical resources constraints, but may incur a loss of solution quality. Many traditional approaches to cyclic scheduling operate by fixing the period value and then solving a linear problem in a generate-and-test fashion. Conversely, our technique is based on a non-linear model and tackles the problem as a whole: the period value is inferred from the scheduling decisions. Our approach has been tested on a number of non-trivial synthetic instances and on a set of realistic industrial instances. The method proved to effective in finding high quality solutions in a very short amount of time.

URLhttp://www.sciencedirect.com/science/article/pii/S0004370213001057
Resources
Publicly Accessible Resources: