Optischedule Algorithm For Automatic Time

Table Generator
Dr. T. Mamatha, Assistant G.V. Aditya, Student, S. Meghana, Student,
Professor, Computer Science Computer Science and Computer Science and
and Engineering Department, Engineering Department, Engineering Department,
Sreenidhi Institute Of Science Institute Of Science and Institute Of Science and
and Technology (SNIST), Technology (SNIST), Technology (SNIST),
Hyderabad, Telangana, India, Hyderabad, Telangana, India, Hyderabad, Telangana, India,
[email protected] [email protected] [email protected]

S. Anvitha, Student, P. Veekshitha, Student,

Computer Science and Computer Science and
Engineering Department, Engineering Department,
Institute Of Science and Institute Of Science and
Technology (SNIST), Technology (SNIST),
Hyderabad, Telangana, India, Hyderabad, Telangana, India,
[email protected] [email protected]

Abstract scheduling requirements. The OptiSchedule

algorithm represents a significant advancement in
Automatic timetable generation is a complex the field of automatic timetable generation. Its
optimization problem with practical applications in ability to produce high-quality schedules while
various domains such as education, healthcare, and considering complex constraints makes it a
event management. The challenge lies in efficiently valuable tool for educational institutions,
scheduling activities while satisfying numerous healthcare facilities, and businesses alike. By
constraints and objectives. In this study, we streamlining scheduling processes and optimizing
propose an OptiSchedule algorithm for automatic resource allocation, OptiSchedule contributes to
timetable generation. The algorithm employs a improved operational efficiency and overall
combination of heuristic search techniques and organizational performance. Through rigorous
metaheuristic optimization methods to iteratively experimentation and evaluation, our study
improve timetable solutions. It starts with demonstrates the effectiveness of the OptiSchedule
initializing a timetable grid and iteratively refines algorithm in improving timetable quality and
the solution by generating neighbouring solutions reducing scheduling overhead. Compared to
and selecting the most promising ones based on an traditional methods, OptiSchedule generates
evaluation function. Through extensive testing and timetables with fewer conflicts and better resource
validation, our OptiSchedule algorithm utilization, leading to enhanced productivity and
demonstrates significant improvements in timetable satisfaction among stakeholders. Moreover, its
quality and efficiency compared to existing flexibility allows for easy customization to
approaches. The algorithm effectively minimizes accommodate diverse scheduling requirements.
conflicts, optimizes resource utilization, and
balances workload distribution. Furthermore, it
provides flexibility for users to input constraints
and preferences, allowing customization to specific Keywords:Metaheuristic optimization methods,
Resource utilization,Scheduling overhead
1.Introduction
Automatic timetable generation is a multifaceted 2. Related Work
challenge pervasive across diverse sectors such as
education, healthcare, and event management, The previous research in automatic timetable
compelling the pursuit of automated solutions to generation spans various optimization techniques,
streamline processes and alleviate the burden of software implementations, case studies, and
manual scheduling[1][2]. Despite continuous emerging methodologies. These studies provide
research efforts, existing methodologies continue to valuable insights into the challenges, solutions, and
grapple with inefficiencies, inflexibilities, and future directions in the field of timetable
suboptimal outcomes[4]. A central complexity lies scheduling.This paper introduces an Evolutionary
in the management of heterogeneous constraints Algorithm (EA) to address the challenging
ranging from resource availability and teacher university timetabling problem. Using a problem-
preferences to student schedules[5][6]. Moreover, specific chromosome representation and intelligent
the dynamic nature of scheduling requirements adaptive mutation, the approach produces feasible
coupled with the imperative of maximizing timetables efficiently, validated with real-world
resource utilization presents an intricate puzzle for data from a large university.[1] This paper reviews
conventional approaches[7][8].In response to these Exam Timetabling using Genetic and Graph
challenges, this paper proposes OptiSchedule, a Coloring algorithms and Semester Timetabling
novel algorithm designed to revolutionize employing Heuristic and Iterated Local Search. It
automatic timetable generation. OptiSchedule aims to provide efficient solutions within
harnesses the power of heuristic search techniques educational constraints, offering innovative ways to
and metaheuristic optimization methods to elevate tackle the challenges of creating accurate
timetable quality, streamline efficiency, and examination and semester timetables.[2] This paper
enhance adaptability across a spectrum of presents a comprehensive timetable strategy by
scheduling contexts [9][10]. The primary incorporating unique elements like Engineering
objectives of this research endeavor encompass a exploration, Team teaching, and mentoring. Using
holistic examination of OptiSchedule's capabilities. Python, the optimized timetable is generated in
Through meticulous empirical validation and three views: class-wise (students), faculty, and
extensive experimentation, this paper seeks to classroom, effectively addressing major and minor
dissect OptiSchedule's performance metrics, challenges.[3] This system streamlines the intricate
meticulously evaluating its proficiency in process of timetable creation for universities,
generating high-quality timetables, optimizing employing algorithms such as genetic, heuristic,
efficiency, and dynamically adapting to varying and resource scheduling. By automating the
scheduling paradigms. Additionally, a comparative generation process based on inputs like subjects,
analysis juxtaposing OptiSchedule against professors, and workload, it optimally utilizes
conventional methods serves to elucidate its resources, minimizing administrative burden and
distinct advantages and underscore its time consumption.[4] Managing course schedules
superiority[11][12].Furthermore,beyond theoretical in a college involves intricate considerations like
exploration, this paper delves into the pragmatic lecturer availability and classroom constraints. To
implications and real-world applications of efficiently address this, a Genetic Algorithm
OptiSchedule. By illuminating its versatility and approach is applied, achieving optimal results in
efficacy in addressing scheduling complexities just 15 seconds for 78 classes and 16
across different sectors, this research aims to chromosomes, ensuring quick and effective
catalyze the adoption of OptiSchedule as a go-to resolution of scheduling challenges.[5] Timetable
solution for automated timetable generation. The creation, historically tedious and error-prone,
seminal contributions of this paper pivot around the prompted the exploration of diverse techniques for
conception and refinement of OptiSchedule, which improvement. This paper focuses on employing
represents a pioneering endeavor at the intersection Genetic Algorithms to address the challenges,
of heuristic search and metaheuristic optimization aiming for a more efficient and error-free timetable
in the realm of automated scheduling algorithms generation process.[6] This project utilizes the
[14][16]. Rapid Application Development (RAD) model to
create a practical timetable algorithm. The
objective is to design an automated timetable stages. Schedule challenge is addressed as a
system that adeptly handles both weak and strong graphical representation issue. Events are arranged
constraints, offering flexibility and ensuring timely in chronological order using certain domain
delivery of results.[7] The paper proposes a novel heuristics, and then they are assigned to precise
multi-agent model for university course time slots, ensuring that no rules are broken. Using
timetabling, leveraging cooperative agents for the graph colouring method, scheduling problem is
highly distributed processing. Unlike previous reduced to its most fundamental components. In
works, the model incorporates constraints that were this graph technique, a node represents a subject
overlooked, aiming to provide an optimal solution and an edge represents disputes. The most
that satisfies both hard and soft constraints. The important component is the building stage, which
approach focuses on reducing temporal complexity, results in a resident of ideal solutions. The
enhancing efficiency in generating timetables for following phase is the improvement phase, where
educational institutions.[8] This paper addresses the best possible answer is produced. This
the often overlooked strategic decisions in approach does not schedule soft restrictions and
university timetabling, focusing on determining takes a very lengthy time to solve a problem.[12]
necessary rooms and teaching periods before the
operational task of assigning lectures. Three bi- 3. Proposed System
objective mixed-integer models, utilizing the ϵ-
3.1 Optischedule Algorithm (OSA):
constraint method, are proposed to analyze the
impact of resource availability on timetabling The OptiSchedule Algorithm (OSA) stands as a
problems, using data from the Second International beacon of efficiency, meticulously crafted to
streamline scheduling processes and maximize
Timetabling Competition (ITC 2007). The study
resource utilization within educational institutions.
explores the interplay between rooms, teaching At its core, it represents a culmination of intricate
periods, and timetable quality, shedding light on design principles aimed at addressing the
the intricate relationship between operational, multifaceted challenges inherent in automated
tactical, and strategic timetabling problems.[9] The timetable generation. The development of such an
study proposes two approaches for optimizing algorithm necessitates a deep understanding of the
room usage in university timetables. The first diverse requirements and constraints unique to each
educational setting, a task not taken lightly by its
employs a two-stage Integer Linear Programming
creators. Drawing inspiration from the robustness
(ILP) with lexicographic optimization, proving to of genetic algorithms, the OptiSchedule Algorithm
be optimal but computationally demanding. The emerges as a tailored solution, finely attuned to the
second introduces a greedy algorithm with a nuances of timetable optimization. It embodies a
specific cost function, demonstrating comparable strategic fusion of algorithmic prowess and
student seating performance to ILP within 2% and domain-specific expertise, ensuring that schedules
significantly faster computation in a real case study are not just generated, but optimized to meet the
dynamic demands of modern educational
at Instituto Superior Técnico, making it a practical
environments.
solution for large datasets. Additionally, the
GRASP algorithm improves solution quality by At the core of the OptiSchedule Algorithm lies a
12% without significant CPU time increase.[10] D. fundamental dedication to efficiency and optimal
Nguyen, K. Nguyen, K. Trieu, and N. Tran (2010), resource utilization. Every aspect of its design,
from the intricacies of its code to the decisions
have automated the scheduling issue at universities
made by its algorithms, is meticulously crafted to
using the Tabu Search technique. In the search achieve a delicate equilibrium between meeting
space that the Tabu Search Algorithm uses, viable scheduling constraints and maximizing the
results are seen. The search space is the set of utilization of available resources. This philosophy
feasible solutions to the issue. Author uses "Tabu," is ingrained in every line of code and algorithmic
or basic building blocks. Tabu allows you to stop decision, reflecting a meticulous attention to detail
cycling and move away from non-improving and a steadfast commitment to excellence. Through
continuous calibration and iterative refinement, the
motions and local optimums. The primary goal of algorithm tirelessly strives to generate schedules
tabu search is to avoid becoming caught at nearby that not only address the immediate needs of
maxima.[11] N. M. Hussin and A. Azlan (2013), educational institutions but also lay the foundation
have put into practise the graph colouring heuristic for long-term operational efficiency and
method for building process scheduling difficulty adaptability. By harnessing the power of heuristic
search techniques and metaheuristic optimization
methods, OptiSchedule not only optimizes
scheduling processes in the present but also
anticipates and adapts to future challenges and
opportunities. Its proactive approach to resource
management ensures that educational institutions
can operate at peak efficiency while remaining
agile and responsive to evolving demands. In
essence, the OptiSchedule Algorithm serves as a
beacon of innovation, driving transformative
change by revolutionizing the way scheduling tasks
are approached and executed within educational
settings. The journey of crafting the OptiSchedule
Algorithm is a testament to the collaborative efforts
of domain experts, algorithm designers, and
software engineers. It is a journey marked by
countless iterations, where each line of code is
scrutinized and optimized to deliver the utmost
value to its end-users. The algorithm's evolution
mirrors the ever-changing landscape of educational
institutions, where adaptability and innovation are
paramount. As educational institutions continue to
evolve and diversify, so too does the OptiSchedule
Algorithm. Its modular architecture and flexible
design ensure that it can seamlessly integrate with
emerging technologies and adapt to evolving user
needs. It stands not just as a static solution but as a
dynamic tool, continuously evolving to meet the
challenges of tomorrow's educational landscape. In
conclusion, the OptiSchedule Algorithm transcends
its role as a mere scheduling tool; it embodies a
comprehensive philosophy centered on efficiency,
adaptability, and relentless pursuit of improvement.
Its meticulous design and unwavering commitment
to optimization establish it as a cornerstone in the
ongoing endeavor to streamline scheduling
processes and optimize resource utilization within
educational institutions. By seamlessly integrating Figure 1 Flowchart of Optischedule algorithm
heuristic search techniques and metaheuristic
optimization methods, OptiSchedule not only In the proposed system, the timetable generation
addresses the immediate challenges of timetable process begins with accessing the homepage of the
generation but also sets a precedent for excellence scheduling tool. Upon arrival, users are prompted
in algorithmic solutions. Its adaptable nature to log in using their unique username and password
enables it to evolve alongside the ever-changing credentials to access the system's functionalities
landscape of scheduling requirements, ensuring securely. Once authenticated, users are guided
that educational institutions remain agile and through a series of steps to input essential data for
responsive to dynamic needs. Moreover, timetable creation. Firstly, they are required to
OptiSchedule serves as a catalyst for continuous input the courses offered by the educational
improvement, fostering a culture of innovation and institution, specifying details such as course names
efficiency within educational institutions. As such, and requirements. Following this, users define the
it represents not just a technological advancement, sizes or capacities of each class, providing crucial
but a transformative force driving positive change information for classroom allocation.
in the realm of scheduling and resource Subsequently, a timetable layout is established,
management. delineating subject slots across the week. With the
groundwork set, users proceed to input details of
3.2 Proposed System flowchart: faculty members available for teaching, including
their names, areas of expertise, and availability
schedules. The system then checks the availability
of faculty members for the specified time slots,
ensuring that each slot is appropriately filled. In
cases where faculty members are unavailable, the
system searches for alternative options to fill the Now, let's substitute example values into the fitness
slots effectively. Once all slots are allocated and function (1):
filled with faculty details, the system generates the
final timetable. This timetable reflects an optimized F(T)=1⋅U(T)−1⋅C(T)−1⋅O(T)
schedule that accommodates course requirements,
class sizes, and faculty availability seamlessly, Suppose we have a timetable with the following
catering to the educational institution's scheduling characteristics:
needs efficiently. The various steps involved in the
execution of this algorithm are as follows U(T)=90 (room utilization score)

Step-1(Initialization) C(T)=20 (penalty for conflicts)

Generate three initial timetables randomly: O(T)=5 (another objective)

Substitute these values into the formula (1):

Tim Mond Tuesd Wedn Thurs Frida
e ay ay esday day y
Slot F(T)=1⋅90−1⋅20−1⋅5

9-10 CS Math Phy CS Math Now, calculate the fitness score:

AM
F(T)=90−20−5=65
10- Phy CS Math CS Phy
11 So, for this specific timetable, the fitness score
AM
F(T) would be 65. The higher the fitness score, the
Table 1 Random timetable 1 is initialised better the timetable is considered in the
optimization process. This process is repeated for
each timetable in the population during the genetic
algorithm's iterations.
Timetable 2 and Timetable 3: Similar random
assignments. Step-3(Selection)

Step-2(Fitness Evaluation) Select timetables based on their fitness ranking.

Higher-ranked timetables are more likely to be
Assume selected for reproduction.

w1=1,w2=1,w3=1 for simplicity Step-4(Crossover/Recombination)

Fitness function: Example:

F(T)=U(T)−C(T)−O(T) Parent 1: CS in the morning.

(1)
Parent 2: Math in the morning.
Here:
Child: Exchange CS and Math to create a new
● F(T) represents the fitness score of the timetable.
timetable
● U(T) represents the objective to maximize Step-5(Mutation)
or optimize in the timetable (e.g.,
minimizing gaps, maximizing room Random Mutation:
utilization, etc.).
● C(T) represents the penalty or cost Example:
associated with constraint violations in the
timetable (e.g., clashes in room allocation, Swap periods between CS and Phy in a random
overlapping schedules, etc.). timetable.
● O(T) represents another objective or factor
that contributes to the fitness function but Step-6(Constraint Management)
is distinct from F(T).
Conflict Avoidance:
Example: Penalizing Class Overlaps (Conflict to favor timetables that adhere to constraints (in
Avoidance) this case, avoiding class overlaps) and contribute to
overall optimization. Different types of penalties
Suppose we have the following timetable: can be defined for various constraints to guide the
algorithm toward generating better schedules.

Time Mond Tuesd Wedne Thurs Frid Step-7(Termination)

Slot ay ay sday day ay
Convergence Check:Terminate when a satisfactory
9-10 Phy CS Math Phy CS
AM
timetable is achieved or after a predefined number
of iterations.
10-11 CS CS Phy Math Mat
AM h Step-8(User Interaction)

Table 2 Random timetable 1 Leave Management:

Example:Professor A requests leave on

Wednesday.

Time Mond Tuesd Wedn Thurs Frida Professor B substitutes.

Slot ay ay esday day y

9-10 CS Math Phy CS Math

AM Step-9(Performance Evaluation)
10-11 Phy CS Math CS Phy
Example:Compare generated timetables against
AM
manually created ones.
Table 3 Random timetable 2
Step-10(Optimization)

Parameter Tuning:
Here, we observe that there is a conflict on
Example:Experiment with different weights in the
Tuesday at the 10-11 AM time slot, where both
fitness function.
Computer Science (CS)classes overlap.

Penalization Logic:
4. Results
Define the Conflict Penalty:Let's say we assign a
penalty of -10 for each class overlap. Our OptiSchedule Algorithm outperforms
competing models in key aspects, affirming its
Calculate the Overlapping Classes:In this example, superiority in automatic timetable generation.
there is one overlapping class on Tuesday.

Apply the Penalty to the Fitness Function:The

penalty for the overlapping class would be -10. 1. Higher Fitness Scores:

- OptiSchedule consistently achieves superior

Update Fitness Score:Subtract the penalty from the
fitness scores compared to various algorithms,
overall fitness score of the timetable.
ensuring schedules that meet diverse criteria
New Fitness Score = Old Fitness Score - Penalty effectively.

As we calculated above, fitness score was 65, the

new fitness score would be 65 - 10 = 55.

The timetable with the class overlap on Tuesday

receives a lower fitness score due to the penalty,
making it less favorable for selection during the
genetic algorithm's evolution process.This
penalization mechanism encourages the algorithm
 - OptiSchedule maintains a higher fairness index,
ensuring equitable distribution of prime-time
classes and resources.

Figure 2 Comparison graph for fitness scores

2. Optimized Clash Minimization: Figure 5 Comparison graph for fairness in

allocation
- OptiSchedule excels in minimizing clashes,
delivering schedules with reduced conflicts and
heightened efficiency.
5. Enhanced Adaptability to Changes:

- OptiSchedule exhibits superior adaptation

speed, accommodating real-time changes without
compromising schedule quality.

Figure 3 Comparison graph for clashes

3. Maximized Room Utilization: Figure 6 Comparison graph for adaptability

- The OptiSchedule Algorithm stands out in room

utilization, maximizing resource efficiency and 6. Reliable Machine Learning Predictions:
providing optimized schedules.
- The model integrates accurate and confident
machine learning predictions, bolstering the
reliability of generated schedules.

Figure 4 Comparison graph for room utilization

Figure 7 Comparison graph for reliability

4. Superior Fairness in Allocation:
 Tim Mon Tues Wed Thu Frid Satu
e day day nesd rsda ay rday
7. Robust Algorithm Convergence: Slot ay y
9:00 DCN IDS IS DCN DCN IS
- OptiSchedule consistently achieves satisfactory AM Lab
timetables, demonstrating robust convergence -
throughout iterations. 9:50
AM
9:50 DCN IS EBD IDS IS DW
AM Lab Lab DM
-
10:4
0
AM
10:4 DCN IS IPR BOE IDS EBD
0 Lab Lab
AM
-
11:3
0
AM
Figure 8 Comparison graph for algorithm 11:3 IDS IS DCN IS EBD Lunc
convergence 0 Lab h
AM
In summary, our OptiSchedule Algorithm stands as -
a superior solution, offering optimized schedules 12:2
0
that surpass competing models in key performance PM
metrics. 12:2 Lunc Lunc Lunc Lunc Lunc DCN
0 h h h h h Lab
PM
-
Course Code Weekly Classes 1:10
BOE 3 PM
IDS 3 1:10 IS DW EBD IPR DW BOE
IS 4 PM DM DM
DWDM 5 - Lab
DCN 4 2:00
IPR 3 PM
EBD 3 2:00 EBD DCN IPR BOE DW
PM DM
Table 4 Course table given by user - Lab
2:50
PM
2:50 BOE Spor DW DW DW
Instructor Name Course Name PM ts DM DM DM
Instructor 1 IDS, IS - Lab
Instructor 2 DWDM, DCN, IPR 3:40
Instructor 3 BOE, EBD PM
Instructor 4 IS, IPR
Instructor 5 DCN, EBD Table 6 Generated output table
Instructor 6 IDS, DWDM
Instructor 7 BOE, IS

Table 5 Instructor table given by user 5. Conclusion and Future scope:

The OptiSchedule algorithm revolutionizes
timetable generation by effectively addressing
Timetable Generated: constraints, optimizing schedules, offering
flexibility, enabling parallelism, and allowing
customization to user preferences. However,
despite its numerous advantages, there are some
limitations to consider. For instance, while the
algorithm can handle various constraints
efficiently, it may struggle with highly complex [4]Tanksali, Prajakta&Dhond, Ila&Pednekar,
scenarios or sudden changes that require immediate Shivani&Singbal, Varshanda&Sivaraman, Shruti.
adjustments. Additionally, although it strives to (2020). AUTOMATED TIMETABLE GENERATION.
fulfill user preferences, there might be instances INTERNATIONAL JOURNAL OF SCIENTIFIC
where certain constraints or preferences conflict, RESEARCH IN COMPUTER SCIENCE,
leading to suboptimal solutions. Furthermore, while ENGINEERING AND INFORMATION
the tool's adaptability and real-time adjustments are TECHNOLOGY. 389-396.
commendable, there could still be instances where [5] Ulum, Pateh&Fitriani, Desti. (2021).
manual intervention is necessary, especially in IMPLEMENTATION OF GENETIC ALGORITHM IN
unique or unforeseen circumstances. Nevertheless, THE CURRENT SCHEDULING SYSTEM.
as automatic timetable generators evolve, JurnalRisetInformatika. 3. 119-126.
incorporating advancements such as predictive
analytics and machine learning, these limitations [6] Wiilams, Kehinde and MichealAjinaja.
are likely to be mitigated, further enhancing their “AUTOMATIC TIMETABLE GENERATION USING
GENETIC ALGORITHM.” Computer Engineering and
usefulness across diverse domains. Automatic
Intelligent Systems, Vol.8, No.1, 2019.
timetable generators will help in the future, not just
in schools but also in hospitals and transportation. [7] Firke, Rajshri, PratikshaBhabad, OmkarGangarde,
They're getting better at making schedules by AbhimannyuMagar and Prof. Anuja. 10, October
considering things like how well students are doing 2023.“AUTOMATIC TIMETABLE
and what teachers like. These systems can adapt in GENERATION SYSTEM.”volume 11.
real-time, handling changes like when a teacher is
absent or there are changes in student numbers. [8]Nouri, HoussemEddine&BelkahlaDriss, Olfa. (2016).
MATP: A MULTI-AGENT MODEL FOR THE
Beyond schools, they might be used in hospitals for
UNIVERSITY TIMETABLING PROBLEM.
patient appointments and staff schedules and in
transportation for better routes and planning. [9]Lindahl, Michael & Mason, Andrew &Stidsen,
Sharing data using the internet (cloud computing) Thomas &Sørensen, Matias. (2017). A Strategic View of
could make these systems more accessible, and University Timetabling. European Journal of Operational
they could also help with things like assigning Research. 266. 10.1016/j.ejor.2017.09.022.
rooms. Plus, if we use cool technologies like virtual
[10]Lemos, Alexandre&Melo, Francisco &Monteiro,
reality, students might be able to see and interact
Pedro &Lynce, Inês. (2018). Room Usage Optimization
with their schedules in a fun way. So, these
in Timetabling: A Case Study at Universidade de Lisboa.
timetable generators are getting smarter and might
100092. 10.1016/j.orp.2018.100092.
be really helpful in lots of different areas in the
future. [11]K. Nguyen, D. Nguyen, K. Trieu, and N. Tran,
“Automating a real-world university timetabling problem
References with Tabu search algorithm,” in 2010 IEEE RIVF
International Conference on Computing &
[1]Srinivasan, D. & Seow, Tian & Xu, Jian-Xin. (2002).
Communication Technologies, Research, Innovation, and
AUTOMATED TIME TABLE GENERATION USING
Vision for the Future (RIVF), 2010
MULTIPLE CONTEXT REASONING FOR
UNIVERSITY MODULES. Proceedings of the 2002 [12] A. Azlan and N. M. Hussin, “Implementing graph
Congress on Evolutionary Computation, CEC 2002. 2. coloring heuristic in construction phase of curriculum-
1751 - 1756. based course timetabling problem,” in 2013 IEEE
Symposium on Computers & Informatics (ISCI), 2013.’
[2]T. W. Ekanayake, P. Subasinghe, S. Ragel, A.
Gamage and S. Attanayaka, "INTELLIGENT [13] ShraddhaThakare, TejalNikam, Prof, MamtaPatil,
TIMETABLE SCHEDULER: A COMPARISON OF Automated Timetable Generation using Genetic
GENETIC, GRAPH COLORING, HEURISTIC AND Algorithm, International Journal of Engineering
ITERATED LOCAL SEARCH ALGORITHMS," 2019 Research & Technology (IJERT) ISSN: 2278-0181,Vol.
International Conference on Advancements in 9 Issue 07, July-2020.
Computing (ICAC), Malabe, Sri Lanka, 2019, pp. 85-90.
[14] T. W. Ekanayake, P. Subasinghe, S. Ragel, A.
[3] Bhatti, Jasdev&Kakkar, Mohit. (2020). TIMETABLE Gamage, and S. Attanayaka, “Intelligent timetable
HANDLING MECHANISM USING PYTHON. scheduler: A comparison of genetic, graph coloring,
International Journal of Scientific & Technology heuristic and iterated local search algorithms,” in 2019
Research. 8. 631-635. International Conference on Advancements in
Computing (ICAC), 2019.
[15] S. Al Perumal, M. Tabassum, N. M. Norwawi, G. Al
NarayanaSamy and S. A. Perumal, "Development of an
Efficient Timetable System using AngularJS and
Bootstrap 3," 2018 8th IEEE International Conference on
Control System, Computing and Engineering (ICCSCE),
Penang, Malaysia, 2018, pp. 70-75, doi:
10.1109/ICCSCE.2018.8685002.