Trustworthy Scheduling Based on Constraint Solving Scheme

Abstract

Most of real-life scheduling problems are dynamic, where we do not know all the time variables of jobs in advance. In such uncertain environment, trustworthy scheduling effectively is a hot topic. In this paper we model the constraints in the dynamic scheduling problems by using CSP model. Moreover, we propose model the time constraint variables in logic way. Based on the constraint models, a constraint solving algorithm for solving the scheduling problems is designed. We prove that this algorithm is sound for solving the scheduling problems. The trustworthy of the schedule system can be promoted by applying this algorithm.