Advertisement

Incremental Software Development Model for Solving Exam Scheduling Problems

  • Maryam Khanian NajafabadiEmail author
  • Azlinah Mohamed
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 937)

Abstract

Examination scheduling is a challenging and time consuming activity among academic administrators of colleges and universities. This is because it involves scheduling a set of exams within a limited number of timeslots, assigning invigilators for each exam and satisfying a set of defined constraints. Scheduling is done to avoid cases in which students sit for more than one exam at the same time or invigilators invigilate more than one exam in different examination venue at the same time or the exams set exceeded the venue capacity. To overcome these challenges, we developed an incremental software model based on greedy algorithm to structure, plan and control the process of an automated schedule construction. Incremental development model using greedy algorithm (IMGA) is used to prioritize the hard and soft constraints and optimize exam scheduling problems. IMGA assigns exams to resources (e.g.: time periods and venues) based on a number of rules. When rules defined are not applicable to the current partial solution, a backtracking is executed in order to find a solution which satisfies all constraints. These processes are done through adaptation of greedy algorithm. Our algorithm iteratively makes one choice after another in order to minimize the conflicts that may have arisen. The advantage of IMGA is that it provides clear-cut solutions to smaller instances of a problem and hence, makes the problem easier to be understood.

Keywords

Timetabling Exam scheduling Incremental development Artificial intelligence 

Notes

Acknowledgements

The authors are grateful to the Research Management Centre (RMC) UiTM for the support under the national Fundamental Research Grant Scheme (600-IRMI/FRGS 5/3).

References

  1. 1.
    Ayob, M., et al.: Intelligent examination timetabling software. Procedia-Soc. Behav. Sci. 18(1), 600–608 (2011)CrossRefGoogle Scholar
  2. 2.
    Alzaqebah, M., Abdullah, S.: Hybrid bee colony optimization for examination timetabling problems. Comput. Oper. Res. 54, 142–154 (2015)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Babaei, H., Karimpour, J., Hadidi, A.: A survey of approaches for university course timetabling problem. Comput. Ind. Eng. 86, 43–59 (2015)CrossRefGoogle Scholar
  4. 4.
    Balakrishnan, N., Lucena, A., Wong, R.T.: Scheduling examinations to reduce second-order conflicts. Comput. Oper. Res. 19(5), 353–361 (1992)CrossRefGoogle Scholar
  5. 5.
    Elloumi, A., Kamoun, H., Jarboui, B., Dammak, A.: The classroom assignment problem: complexity, size reduction and heuristics. Appl. Soft Comput. 14, 677–686 (2014)CrossRefGoogle Scholar
  6. 6.
    Leite, N., Fernandes, C.M., Melício, F., Rosa, A.C.: A cellular memetic algorithm for the examination timetabling problem. Comput. Oper. Res. 94, 118–138 (2018)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Muklason, A., Parkes, A.J., Özcan, E., McCollum, B., McMullan, P.: Fairness in examination timetabling: student preferences and extended formulations. Appl. Soft Comput. 55, 302–318 (2017)CrossRefGoogle Scholar
  8. 8.
    Pillay, N., Banzhaf, W.: An informed genetic algorithm for the examination timetabling problem. Appl. Soft Comput. 10(2), 457–467 (2010)CrossRefGoogle Scholar
  9. 9.
    Qaurooni, D., Akbarzadeh-T, M.R.: Course timetabling using evolutionary operators. Appl. Soft Comput. 13(5), 2504–2514 (2013)CrossRefGoogle Scholar
  10. 10.
    Rahman, S.A., Bargiela, A., Burke, E.K., Özcan, E., McCollum, B., McMullan, P.: Adaptive linear combination of heuristic orderings in constructing examination timetables. Eur. J. Oper. Res. 232(2), 287–297 (2014)CrossRefGoogle Scholar
  11. 11.
    Saviniec, L., Santos, M.O., Costa, A.M.: Parallel local search algorithms for high school timetabling problems. Eur. J. Oper. Res. 265(1), 81–98 (2018)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Saviniec, L., Constantino, A.: Effective local search algorithms for high school timetabling problems. Appl. Soft Comput. 60, 363–373 (2017)CrossRefGoogle Scholar
  13. 13.
    Sagir, M., Ozturk, Z.K.: Exam scheduling: mathematical modeling and parameter estimation with the analytic network process approach. Math. Comput. Model. 52(5–6), 930–941 (2010)CrossRefGoogle Scholar
  14. 14.
    Song, T., Liu, S., Tang, X., Peng, X., Chen, M.: An iterated local search algorithm for the University Course Timetabling Problem. Appl. Soft Comput. 68, 597–608 (2018)CrossRefGoogle Scholar
  15. 15.
    Turabieh, H., Abdullah, S.: An integrated hybrid approach to the examination timetabling problem. Omega 39(6), 598–607 (2011)CrossRefGoogle Scholar
  16. 16.
    Kahar, M.N.M., Kendall, G.: The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution. Eur. J. Oper. Res. 207(2), 557–565 (2010)CrossRefGoogle Scholar
  17. 17.
    Woumans, G., De Boeck, L., Beliën, J., Creemers, S.: A column generation approach for solving the examination-timetabling problem. Eur. J. Oper. Res. 253(1), 178–194 (2016)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Amaral, P., Pais, T.C.: Compromise ratio with weighting functions in a Tabu Search multi-criteria approach to examination timetabling. Comput. Oper. Res. 72, 160–174 (2016)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Koulinas, G.K., Anagnostopoulos, K.P.: A new tabu search-based hyper-heuristic algorithm for solving construction leveling problems with limited resource availabilities. Autom. Constr. 31, 169–175 (2013)CrossRefGoogle Scholar
  20. 20.
    Perkusich, M., Soares, G., Almeida, H., Perkusich, A.: A procedure to detect problems of processes in software development projects using Bayesian networks. Expert Syst. Appl. 42(1), 437–450 (2015)CrossRefGoogle Scholar
  21. 21.
    Lei, H., Ganjeizadeh, F., Jayachandran, P.K., Ozcan, P.A.: Statistical analysis of the effects of Scrum and Kanban on software development projects. Robot. Comput.-Integr. Manuf. 43, 59–67 (2017)CrossRefGoogle Scholar
  22. 22.
    Qureshi, M.R.J., Hussain, S.A.: An adaptive software development process model. Adv. Eng. Softw. 39(8), 654–658 (2008)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Advanced Analytics Engineering Centre, Faculty of Computer and Mathematical SciencesUniversiti Teknologi MARAShah AlamMalaysia

Personalised recommendations