Oracle Corporation
Using constraint programming to obtain a machine maintenance schedule for maintaining machines

Abstract:

Using constraint programming (CP) to obtain a machine maintenance schedule is described. A data model generator generates a CP data model, including a set of task elements representing a set of maintenance tasks, and a set of time elements representing a set of time windows. The CP data model further includes a constraint that requires each task element to be assigned a time window from a respective domain, such that each time element is assigned a task count from a respective domain. A search directive generator generates a CP search directive, including applying different time window prioritization methods to maintenance tasks for machines having different failure probabilities. One prioritization method may prioritize time windows based on delinquency costs. Another prioritization method may prioritize time windows based on a current maintenance schedule. A CP solver determines a proposed maintenance schedule based on the CP data model and the CP search directive.