A Distributed Approach for Scheduling Classes at Educational Institute

Abstract

Academic experiments are being conducted at a rapid rate, making time table scheduling automation in educational institutions imperative. These frequently updated, strategically planned teaching and learning frameworks must be applied at the institutional level, which requires institutions to alter their outdated scheduling procedures. While manual scheduling is feasible, it requires hours of continuous concentration to verify a multitude of limitations, which is inhumane. It is far more laborious to modify the scheduled classes than it is to do rescheduling. The Constraint Satisfaction Problem (CSP) technique is a logical choice for scheduling automation. It could be scheduled more quickly using a Distributed Constraint Satisfaction Problem (DCSP) method. Given that the current scheduling work has multiple objectives as well as distributed in nature, the DCSP technique is the preferable option. In order to map the problem as a DCSP, we first address it as a distributed problem in this study. An asynchronous backtracking technique is then used to reach to a solution.