Constraint programming approach to design of deadlock-free schedules in concurrent production systems

This work presents constraint programming (CP) approach applied to determine deadlock-free schedules in concurrent production processes. The rules of resource conflict resolution have been expressed by means of a set of predicates, which define constraints for the problem decisive variables. Predicate model has been defined in time and event domains and implemented in procedures of propagating and distributing the variable values. The predicates define sufficient conditions for existence of deadlock-free schedules of operations, which meet the prescribed qualitative and quantitative constraints