A Classroom Scheduling Service for Smart Classes

During past decades, the classroom scheduling problem has posed significant challenges to educational programmers and teaching secretaries. In order to alleviate the burden of the programmers, this paper presents SmartClass, which allows the programmers to solve this problem using web services. By introducing service-oriented architecture (SOA), SmartClass is able to provide classroom scheduling services with back-stage design space exploration and greedy algorithms. Furthermore, the SmartClass architecture can be dynamically coupled to different scheduling algorithms (e.g. Greedy, DSE, etc.) to fit in specific demands. A typical case study demonstrates that SmartClass provides a new efficient paradigm to the traditional classroom scheduling problem, which could achieve high flexibility by software services reuse and ease the burden of educational programmers. Evaluation results on efficiency, overheads and scheduling performance demonstrate the SmartClass has lower scheduling overheads with higher efficiency.

[1]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[2]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[3]  Fadi A. Aloul,et al.  Solving the University Class Scheduling Problem Using Advanced ILP Techniques , 2007 .

[4]  Ronald L. Rardin,et al.  Large-scale classroom scheduling , 1996 .

[5]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[6]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[7]  Rob A. Rutenbar,et al.  A comparative study of two Boolean formulations of FPGA detailed routing constraints , 2001, IEEE Transactions on Computers.

[8]  Amal Dandashi,et al.  Graph Coloring for class scheduling , 2010, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010.

[9]  Christina Kluge,et al.  Service-Oriented Architecture: Concepts, Technology, and Design , 2005 .

[10]  Igor L. Markov,et al.  Breaking instance-independent symmetries in exact graph coloring , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[11]  Der-Fang Shiau,et al.  A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences , 2011, Expert Syst. Appl..

[12]  Igor L. Markov,et al.  Generic ILP versus specialized 0-1 ILP: an update , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[13]  P. Mohana Shankar,et al.  Simulation of flat fading using MATLAB for classroom instruction , 2002, IEEE Trans. Educ..

[14]  David Ting,et al.  Combining the min-conflicts and look-forward heuristics to effectively solve a set of hard university timetabling problems , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.

[15]  Graham Kendall,et al.  A multi-objective hyper-heuristic based on choice function , 2014, Expert Syst. Appl..

[16]  David Blaauw,et al.  Robust SAT-Based Search Algorithm for Leakage Power Reduction , 2002, PATMOS.

[17]  Chao Wang,et al.  SmartClass: A Services-Oriented Approach for University Resource Scheduling , 2013, 2013 IEEE International Conference on Services Computing.

[18]  Kathleen E. Cook,et al.  Comparing the Effectiveness of an Inverted Classroom to a Traditional Classroom in an Upper-Division Engineering Course , 2013, IEEE Transactions on Education.

[19]  T. Redl,et al.  Timetabling via Graph Coloring : An Alternative Approach , .