By Topic

Trustworthy Scheduling Based on Constraint Solving Scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Juyang Zhang ; Software Eng. Instn., East China Normal Univ., Shanghai, China ; Yixiang Chen

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.

Published in:

Computer Sciences and Convergence Information Technology, 2009. ICCIT '09. Fourth International Conference on

Date of Conference:

24-26 Nov. 2009