Management of electronic ledger: a constraint programming approach for solving curricula scheduling problems

Curricula timetabling belongs to the scheduling and planning domain of artificial intelligence, the problem largely recognised by its key importance for initiating and afterward regulating the curricula events. In the literature the issue is reflected as a resources management job against puzzling constraints. The group of hard constraints requires the vital priority and must be removed, whereas the degree of solving of soft constraints upraises the quality scale and leads to optimal solution at the end. Constraint programming is one of the contemporary techniques that shape the research work presented in this article. The research investigates a constraint programming framework to examine over the various datasets. The study proposes and implements three incremental low-level heuristics operated by min-conflict algorithm approach for solving identical but unequal benchmark scheduling instances. The framework is designed in such way to provide fair chance of randomisation and incremental calculation to parameters in order to keep up the accuracy. The acquired prominent results validated the effectiveness and correctness of proposed methodology.