Scheduling People's Daily Activities Using Temporal Constraints Satisfaction Problem

One of the most prominent approaches in the field of planning and scheduling is Constraint Satisfaction Problem (CSP), which is the process of finding a solution according to a set of constraints, the paper aims to discuss the possibility of using constraint satisfaction in scheduling people's daily activities and proposes an automatic scheduling algorithm that aids the users to plan their everyday activities, the scheduling process released using the concepts of Temporal Constraint Satisfaction Problem (TCSP). The paper suggests a scenario and explains the properties of the human being's daily activity to be absorbed in a TCSP algorithm, and proposes a set of special constraints the algorithm will tie itself to them to produce a final schedule that may satisfy the user. Searching for a solution will be done using backtracking and back-jumping techniques.