IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v59y2022i3d10.1007_s12597-022-00590-4.html
   My bibliography  Save this article

Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy

Author

Listed:
  • T. Godwin

    (Indian Institute of Management Tiruchirappalli)

Abstract

Business schools that follow an elective system allows a student to select required number of electives in a semester from a larger pool. The resulting heterogeneous elective selection combinations across students make it challenging to arrive at a quality examination timetable. An examination timetable is characterized by the day, the scheduled slot in the day and the classroom during the scheduled slot for each exam. Five quality metrics for examination timetable are developed and accordingly 0–1 linear integer programs formulated for each metric. Surrogacy as a concept is proposed through which a given problem is solved either through another objective function or through a subset of the problem or a combination of both. The resulting findings indicate the usefulness of the proposed mathematical programs and the developed solution approaches in achieving quality elective examination timetable.

Suggested Citation

  • T. Godwin, 2022. "Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy," OPSEARCH, Springer;Operational Research Society of India, vol. 59(3), pages 1055-1093, September.
    • Handle: RePEc:spr:opsear:v:59:y:2022:i:3:d:10.1007_s12597-022-00590-4
    DOI: 10.1007/s12597-022-00590-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-022-00590-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-022-00590-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Christine Mumford, 2010. "A multiobjective framework for heavily constrained examination timetabling problems," Annals of Operations Research, Springer, vol. 180(1), pages 3-31, November.
    2. de Werra, D., 1985. "An introduction to timetabling," European Journal of Operational Research, Elsevier, vol. 19(2), pages 151-162, February.
    3. Dimopoulou, M. & Miliotis, P., 2001. "Implementation of a university course and examination timetabling system," European Journal of Operational Research, Elsevier, vol. 130(1), pages 202-213, April.
    4. Edmund Burke & Nam Pham & Rong Qu & Jay Yellen, 2012. "Linear combinations of heuristics for examination timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 89-109, April.
    5. Barry McCollum & Paul McMullan & Andrew Parkes & Edmund Burke & Rong Qu, 2012. "A new model for automated examination timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 291-315, April.
    6. Balakrishnan, N, 1991. "Examination scheduling: A computerized application," Omega, Elsevier, vol. 19(1), pages 37-41.
    7. de Werra, D., 1997. "The combinatorics of timetabling," European Journal of Operational Research, Elsevier, vol. 96(3), pages 504-513, February.
    8. Massimiliano Caramia & Paolo Dell'Olmo & Giuseppe F. Italiano, 2008. "Novel Local-Search-Based Approaches to University Examination Timetabling," INFORMS Journal on Computing, INFORMS, vol. 20(1), pages 86-99, February.
    9. Qu, Rong & Burke, Edmund K. & McCollum, Barry, 2009. "Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems," European Journal of Operational Research, Elsevier, vol. 198(2), pages 392-404, October.
    10. Pillay, N. & Banzhaf, W., 2009. "A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 482-491, September.
    11. White, George M. & Xie, Bill S. & Zonjic, Stevan, 2004. "Using tabu search with longer-term memory and relaxation to create examination timetables," European Journal of Operational Research, Elsevier, vol. 153(1), pages 80-91, February.
    12. Turabieh, Hamza & Abdullah, Salwani, 2011. "An integrated hybrid approach to the examination timetabling problem," Omega, Elsevier, vol. 39(6), pages 598-607, December.
    13. Tiago Pais & Paula Amaral, 2012. "Managing the tabu list length using a fuzzy inference system: an application to examination timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 341-363, April.
    14. Edmund Burke & Graham Kendall & Mustafa Mısır & Ender Özcan, 2012. "Monte Carlo hyper-heuristics for examination timetabling," Annals of Operations Research, Springer, vol. 196(1), pages 73-90, July.
    15. E.K. Burke & J.P. Newall, 2004. "Solving Examination Timetabling Problems through Adaption of Heuristic Orderings," Annals of Operations Research, Springer, vol. 129(1), pages 107-134, July.
    16. Weitz, R. R. & Lakshminarayanan, S., 1997. "An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups, VLSI design, and exam scheduling," Omega, Elsevier, vol. 25(4), pages 473-482, August.
    17. Michael W. Carter, 1986. "OR Practice—A Survey of Practical Applications of Examination Timetabling Algorithms," Operations Research, INFORMS, vol. 34(2), pages 193-202, April.
    18. Christos Gogos & Panayiotis Alefragis & Efthymios Housos, 2012. "An improved multi-staged algorithmic process for the solution of the examination timetabling problem," Annals of Operations Research, Springer, vol. 194(1), pages 203-221, April.
    19. Massimiliano Caramia & Paolo Dell’Olmo, 2007. "Coupling Stochastic and Deterministic Local Search in Examination Timetabling," Operations Research, INFORMS, vol. 55(2), pages 351-366, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Saeedeh Bazari & Alireza Pooya & Omid Soleimani Fard & Pardis Roozkhosh, 2023. "Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions," OPSEARCH, Springer;Operational Research Society of India, vol. 60(2), pages 877-915, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    2. Alejandro Cataldo & Juan-Carlos Ferrer & Jaime Miranda & Pablo A. Rey & Antoine Sauré, 2017. "An integer programming approach to curriculum-based examination timetabling," Annals of Operations Research, Springer, vol. 258(2), pages 369-393, November.
    3. Abdul Rahman, Syariza & Bargiela, Andrzej & Burke, Edmund K. & Özcan, Ender & McCollum, Barry & McMullan, Paul, 2014. "Adaptive linear combination of heuristic orderings in constructing examination timetables," European Journal of Operational Research, Elsevier, vol. 232(2), pages 287-297.
    4. Mohammed Al-Betar & Ahamad Khader & Iyad Doush, 2014. "Memetic techniques for examination timetabling," Annals of Operations Research, Springer, vol. 218(1), pages 23-50, July.
    5. Turabieh, Hamza & Abdullah, Salwani, 2011. "An integrated hybrid approach to the examination timetabling problem," Omega, Elsevier, vol. 39(6), pages 598-607, December.
    6. Syariza Abdul-Rahman & Edmund Burke & Andrzej Bargiela & Barry McCollum & Ender Özcan, 2014. "A constructive approach to examination timetabling based on adaptive decomposition and ordering," Annals of Operations Research, Springer, vol. 218(1), pages 3-21, July.
    7. Taha Arbaoui & Jean-Paul Boufflet & Aziz Moukrim, 2015. "Preprocessing and an improved MIP model for examination timetabling," Annals of Operations Research, Springer, vol. 229(1), pages 19-40, June.
    8. R Qu & E K Burke, 2009. "Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1273-1285, September.
    9. Burke, E.K. & Eckersley, A.J. & McCollum, B. & Petrovic, S. & Qu, R., 2010. "Hybrid variable neighbourhood approaches to university exam timetabling," European Journal of Operational Research, Elsevier, vol. 206(1), pages 46-53, October.
    10. De Boeck, Liesje & Beliën, Jeroen & Creemers, Stefan, 2016. "A column generation approach for solving the examination-timetabling problemAuthor-Name: Woumans, Gert," European Journal of Operational Research, Elsevier, vol. 253(1), pages 178-194.
    11. Álvaro García-Sánchez & Araceli Hernández & Eduardo Caro & Gonzalo Jiménez, 2019. "Universidad Politécnica de Madrid Uses Integer Programming for Scheduling Weekly Assessment Activities," Interfaces, INFORMS, vol. 49(2), pages 104-116, March.
    12. Edmund K. Burke & Yuri Bykov, 2016. "An Adaptive Flex-Deluge Approach to University Exam Timetabling," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 781-794, November.
    13. Dimopoulou, M. & Miliotis, P., 2001. "Implementation of a university course and examination timetabling system," European Journal of Operational Research, Elsevier, vol. 130(1), pages 202-213, April.
    14. Daskalaki, S. & Birbas, T., 2005. "Efficient solutions for a university timetabling problem through integer programming," European Journal of Operational Research, Elsevier, vol. 160(1), pages 106-120, January.
    15. G N Beligiannis & C Moschopoulos & S D Likothanassis, 2009. "A genetic algorithm approach to school timetabling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 23-42, January.
    16. Saeedeh Bazari & Alireza Pooya & Omid Soleimani Fard & Pardis Roozkhosh, 2023. "Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions," OPSEARCH, Springer;Operational Research Society of India, vol. 60(2), pages 877-915, June.
    17. Nossack, Jenny, 2022. "Therapy scheduling and therapy planning at hospitals," Omega, Elsevier, vol. 109(C).
    18. S Abdullah & S Ahmadi & E K Burke & M Dror & B McCollum, 2007. "A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(11), pages 1494-1502, November.
    19. Urban, Timothy L. & Russell, Robert A., 2003. "Scheduling sports competitions on multiple venues," European Journal of Operational Research, Elsevier, vol. 148(2), pages 302-311, July.
    20. Edmund Burke & Rong Qu & Amr Soghier, 2014. "Adaptive selection of heuristics for improving exam timetables," Annals of Operations Research, Springer, vol. 218(1), pages 129-145, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:opsear:v:59:y:2022:i:3:d:10.1007_s12597-022-00590-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.