High School Timetable Scheduling Vector Space Formulation

A. Mozaffary¹ , R. Shafaroudi²

Section:Research Paper, Product Type: Journal-Paper
Vol.8 , Issue.4 , pp.14-17, Aug-2021

Online published on Aug 31, 2021

Copyright © A. Mozaffary, R. Shafaroudi . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

Abstract :
Timetable scheduling for high school is a challenging problem. Problem formulation is the first stage, and solving is the next. This problem is a NP-complete problem. An exact formulation for scheduling in a vector space is presented. With 6 constrains the condition and scope of a high school timetable is fully defined. The possibility of presenting a course (subject) in two or more days and also in several half-sessions is considered. Four constrains are linear and two of them that prevents conflictions between subjects are dot products of state vectors.Each session divided in two half-sections and the procedure has the ability to arrange sessions in continues and successive orders.

Key-Words / Index Term :
timetable, scheduling, highschool, formulation, space vector

References :
[1] Kristiansen, Simon; Stidsen, Thomas Riis, “A Comprehensive Study of Educational Timetabling - a Survey”, DTU Management Engineering,2013
[2] A. Schaerf, “A Survey of Automated Timetabling”,Artificial Inteligence review, 1996
[3] J.-C. R´egin, A ?ltering algorithm for constraints of di?erence in CSPs, Twelth National Conference on Arti?cial Intelligence,1994
[4] Jean-Charles R´egin,”Generalized arc consistency for global cardinality constraint”, American Association for Artificial Intelligence (AAAI’96), 209-215, 1996
[5] Pardalos,P.M.andM.G.C.Resende,”HandbookofAppliedOptimization.” Oxford University Press, USA,2002
[6] N.M. Morade , "Reduction Method Using Minimum Supply And Demand Method to Find an Initial Basic Feasible Solution of Transportation Problem," International Journal of Computer Sciences and Engineering, Vol.7, Issue.1, pp.46-50, 2019.