Automatic Timetable Generator

[{“box”:0,”content”:”

n

Year : November 29, 2023 | Volume : 01 | Issue : 01 | Page : 21-25

n

n

n

n

n

n

By

n

    n t

    [foreach 286]n

    n

    Shubham Yadav, Omkar Pasalkar, Aniket Marne, Manisha P. Navale, Atharva Pawar

  1. [/foreach]

    n

n

n

    [foreach 286] [if 1175 not_equal=””]n t

  1. Assistant Professor, Student, Student, Student, Student, Department of Mechanical Engineering, NBNSTIC, Department of Mechanical Engineering, NBNSTIC, Department of Mechanical Engineering, NBNSTIC, Department of Mechanical Engineering, NBNSTIC, Department of Mechanical Engineering, NBNSTIC, Maharashtra, Maharashtra, Maharashtra, Maharashtra, Maharashtra, India, India, India, India, India
  2. n[/if 1175][/foreach]

n

n

Abstract

nMaking a schedule manually is exceedingly challenging in today’s literate environment. Timetables must be made specifically for each branch and each year. It becomes quite chaotic, time-consuming,
and labor-intensive to manually prepare the timetables. When a staff member needs to be substituted or is on leave, the process can occasionally become complicated. In our effort, we have developed a timetable-creation algorithm that will save a lot of time while lessen the workload and pressure on the employee. By using software to complete the task, much time is saved, and complex circumstances can also have schedules created. Additionally, it will prevent human error due to subject overlap and open positions. The creation of timetables is a difficult and time-consuming task, but it is essential to the coordination of many operations in educational institutions. The development of automatic timetable generation technologies has significantly streamlined this procedure, lowering labour costs and increasing productivity. This study paper offers a thorough examination and critique of the piece named “Automatic Timetable Generator.” The fundamental ideas, methods, benefits, and difficulties of automatic timetable creation systems are examined in this work. It also examines how these systems affect educational institutions and identifies possible topics for additional study and
development.

n

n

n

Keywords: Genetic Algorithm, Automated Timetable, Soft And Hard Constrains.

n[if 424 equals=”Regular Issue”][This article belongs to International Journal of Advanced Robotics and Automation Technology(ijarat)]

n

[/if 424][if 424 equals=”Special Issue”][This article belongs to Special Issue under section in International Journal of Advanced Robotics and Automation Technology(ijarat)][/if 424][if 424 equals=”Conference”]This article belongs to Conference [/if 424]

n

n

n

How to cite this article: Shubham Yadav, Omkar Pasalkar, Aniket Marne, Manisha P. Navale, Atharva Pawar Automatic Timetable Generator ijarat November 29, 2023; 01:21-25

n

How to cite this URL: Shubham Yadav, Omkar Pasalkar, Aniket Marne, Manisha P. Navale, Atharva Pawar Automatic Timetable Generator ijarat November 29, 2023 {cited November 29, 2023};01:21-25. Available from: https://journals.stmjournals.com/ijarat/article=November 29, 2023/view=0/

nn


nn[if 992 equals=”Open Access”] Full Text PDF[else] nvar fieldValue = “[user_role]”;nif (fieldValue == ‘indexingbodies’) {n document.write(‘Full Text PDF‘);n }nelse if (fieldValue == ‘administrator’) { document.write(‘Full Text PDF‘); }nelse if (fieldValue == ‘ijarat’) { document.write(‘Full Text PDF‘); }n else { document.write(‘ ‘); }n [/if 992] [if 379 not_equal=””]nn

Browse Figures

n

n

[foreach 379]n

n[/foreach]n

nn

n

n[/if 379]n

n

References

n[if 1104 equals=””]n

  1. Ceschia S, Di Gaspero L, Schaerf A. Educational timetabling: problems, bench-marks, and state-of-the-art results. Eur J Oper Res. 2022; 308 (1): 1–18.
  2. Rane MV, Apte VM, Nerkar VN, Edinburgh MR, Rajput Automated timetabling system for university course. In: 2021 International Conference on Emerging Smart Computing and Informatics (ESCI), Pune, India, March 5–7, 2021. pp. 328–334. doi: 10.1109/ESCI50559.2021.9396906.
  3. Tan JS, Goh SL, Kendall G, Sabard NR. A survey of the state-of-the-art of optimisation methodologies in school timetabling problems. Expert Syst Appl. 2021; 165: 113943.
  4. Saviniec L, Santos MO, Costa AM, dos Santos Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems. Eur J Oper Res. 2020; 280 (3):
    1064–1081.
  5. Ekanayake TW, Subasinghe P, Ragel S, Gamage A, Attanayaka Intelligent timetable scheduler: a comparison of genetic graph coloring, heuristic and iterated local search algorithms. In: 2019 International Conference on Advancements in Computing (ICAC), Malabe, Sri Lanka, December 5–7, 2019. pp. 85–90. doi: 10.1109/ICAC49085.2019.9103403.
  6. Al Perumal S, Tabassum M, Norwani NM, Al Narayana Samy G, Perumal Development of an efficient timetable system using AngularJS and Bootstrap3. In: 2018 8th IEEE International Conference on Control System, Computing and Engineering (ICCSCE), Penang, Malaysia, November 23–25, 2018. pp. 70–75. doi: 10.1109/ICCSCE.2018.8685002.
  7. Bodas N, Shah J, Shah Y, Sontakke A, Dhangar D. Exam cell automation system and timetable generator. Int J Creative Res Thoughts. 2018; 6 (2): 1045–1049.
  8. Lahoti Y, Punekar A, Patel H, Bhimsariya Automated timetable generator. Int J Sci Res. 2017; 6 (1): 2004–2007.
  9. Burke EK, Petrovic Recent research directions in automated timetabling. Eur J Oper Res. 2002; 140 (2): 266–280.
  10. Chowdhary A, Kakde P, Dhoke S, Ingle S, Rushiya R, Gawande D. Timetable generation system. Int J Computer Sci Mobile Comput. 2014; 3 (2): 410–414

nn[/if 1104][if 1104 not_equal=””]n

    [foreach 1102]n t

  1. [if 1106 equals=””], [/if 1106][if 1106 not_equal=””],[/if 1106]
  2. n[/foreach]

n[/if 1104]

nn


nn[if 1114 equals=”Yes”]n

n[/if 1114]

n

n

Regular Issue Open Access Review Article

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

n

Volume 01
Issue 01
Received June 20, 2023
Accepted July 9, 2023
Published November 29, 2023

n

n

n

[if 1190 not_equal=””]n

Editor

n

[foreach 1188]n

n[/foreach]

n[/if 1190] [if 1177 not_equal=””]n

Reviewer

n

[foreach 1176]n

n[/foreach]

n[/if 1177]

n

n

n

n function myFunction2() {n var x = document.getElementById(“browsefigure”);n if (x.style.display === “block”) {n x.style.display = “none”;n }n else { x.style.display = “Block”; }n }n document.querySelector(“.prevBtn”).addEventListener(“click”, () => {n changeSlides(-1);n });n document.querySelector(“.nextBtn”).addEventListener(“click”, () => {n changeSlides(1);n });n var slideIndex = 1;n showSlides(slideIndex);n function changeSlides(n) {n showSlides((slideIndex += n));n }n function currentSlide(n) {n showSlides((slideIndex = n));n }n function showSlides(n) {n var i;n var slides = document.getElementsByClassName(“Slide”);n var dots = document.getElementsByClassName(“Navdot”);n if (n > slides.length) { slideIndex = 1; }n if (n (item.style.display = “none”));n Array.from(dots).forEach(n item => (item.className = item.className.replace(” selected”, “”))n );n slides[slideIndex – 1].style.display = “block”;n dots[slideIndex – 1].className += ” selected”;n }n n function myfun() {n x = document.getElementById(“editor”);n y = document.getElementById(“down”);n z = document.getElementById(“up”);n if (x.style.display == “none”) {n x.style.display = “block”;n }n else {n x.style.display = “none”;n }n if (y.style.display == “none”) {n y.style.display = “block”;n }n else {n y.style.display = “none”;n }n if (z.style.display == “none”) {n z.style.display = “block”;n }n else {n z.style.display = “none”;n }n }n function myfun2() {n x = document.getElementById(“reviewer”);n y = document.getElementById(“down2”);n z = document.getElementById(“up2”);n if (x.style.display == “none”) {n x.style.display = “block”;n }n else {n x.style.display = “none”;n }n if (y.style.display == “none”) {n y.style.display = “block”;n }n else {n y.style.display = “none”;n }n if (z.style.display == “none”) {n z.style.display = “block”;n }n else {n z.style.display = “none”;n }n }n”}]