IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i19p2500-d650657.html
   My bibliography  Save this article

Solving a University Course Timetabling Problem Based on AACSB Policies

Author

Listed:
  • Nancy M. Arratia-Martinez

    (Department of Business Administration, Universidad de las Américas Puebla/Ex-Hacienda Santa Catarina Mártir, San Andres Cholula, Puebla 72810, Mexico
    These authors contributed equally to this work.)

  • Paulina A. Avila-Torres

    (Department of Business Administration, Universidad de las Américas Puebla/Ex-Hacienda Santa Catarina Mártir, San Andres Cholula, Puebla 72810, Mexico
    These authors contributed equally to this work.)

  • Juana C. Trujillo-Reyes

    (Department of Business Administration, Universidad de las Américas Puebla/Ex-Hacienda Santa Catarina Mártir, San Andres Cholula, Puebla 72810, Mexico
    These authors contributed equally to this work.)

Abstract

The purpose of this research is to solve the university course timetabling problem (UCTP) that consists of designing a schedule of the courses to be offered in one academic period based on students’ demand, faculty composition and institutional constraints considering the policies established in the standards of the Association to Advance Collegiate Schools of Business (AACSB) accreditation. These standards involve faculty assignment with high level credentials that have to be fulfilled for business schools on the road to seek recognition and differentiation while providing exceptional learning. A new mathematical model for UCTP is proposed. The model allows the course-section-professor-time slot to be assigned for an academic department strategically using the faculty workload, course overload, and the fulfillment of the AACSB criteria. Further, the courses that will require new hires are classified according to the faculty qualifications stablished by AACSB. A real-world case is described and solved to show the efficiency of the proposed model. An analysis of different strategies derived from institutional policies that impacts the resulting timetabling is also presented. The results show the course overload could be a valuable strategy for helping mitigate the total of new hires needed. The proposed model allows to create the course at the same time the AACSB standards are met.

Suggested Citation

  • Nancy M. Arratia-Martinez & Paulina A. Avila-Torres & Juana C. Trujillo-Reyes, 2021. "Solving a University Course Timetabling Problem Based on AACSB Policies," Mathematics, MDPI, vol. 9(19), pages 1-19, October.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:19:p:2500-:d:650657
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/19/2500/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/19/2500/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Al-Yakoob, Salem M. & Sherali, Hanif D., 2006. "Mathematical programming models and algorithms for a class-faculty assignment problem," European Journal of Operational Research, Elsevier, vol. 173(2), pages 488-507, September.
    2. Domenech, B & Lusa, A, 2016. "A MILP model for the teacher assignment problem considering teachers’ preferences," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1153-1160.
    3. Moritz Mühlenthaler & Rolf Wanka, 2016. "Fairness in academic course timetabling," Annals of Operations Research, Springer, vol. 239(1), pages 171-188, April.
    Full references (including those not matched with items on IDEAS)

    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. Caselli, Giulia & Delorme, Maxence & Iori, Manuel, 2022. "Integer linear programming for the Tutor Allocation Problem : A practical case in a British University," Other publications TiSEM 983593a6-c17d-4b87-8ee1-a, Tilburg University, School of Economics and Management.
    2. P. Solano Cutillas & D. Pérez-Perales & M. M. E. Alemany Díaz, 2022. "A mathematical programming tool for an efficient decision-making on teaching assignment under non-regular time schedules," Operational Research, Springer, vol. 22(3), pages 2899-2942, July.
    3. David Rea & Craig Froehle & Suzanne Masterson & Brian Stettler & Gregory Fermann & Arthur Pancioli, 2021. "Unequal but Fair: Incorporating Distributive Justice in Operational Allocation Models," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2304-2320, July.
    4. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    5. Argyris, Nikolaos & Karsu, Özlem & Yavuz, Mirel, 2022. "Fair resource allocation: Using welfare-based dominance constraints," European Journal of Operational Research, Elsevier, vol. 297(2), pages 560-578.
    6. Narjes MASHHADI BANDANI & Alireza NADERI & Mohsen AKBARPOUR SHIRZAEI, 2017. "Cement Transportation Limited-Fleet Modeling And Assigning To Rated Demands," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 12(1), pages 111-123, March.
    7. De Causmaecker, Patrick & Demeester, Peter & Vanden Berghe, Greet, 2009. "A decomposed metaheuristic approach for a real-world university timetabling problem," European Journal of Operational Research, Elsevier, vol. 195(1), pages 307-318, May.
    8. Dönmez, Kadir & Demirel, Soner & Özdemir, Mustafa, 2020. "Handling the pseudo pilot assignment problem in air traffic control training by using NASA TLX," Journal of Air Transport Management, Elsevier, vol. 89(C).
    9. Geiger, Martin Josef & Wenger, Wolf, 2010. "On the assignment of students to topics: A Variable Neighborhood Search approach," Socio-Economic Planning Sciences, Elsevier, vol. 44(1), pages 25-34, March.
    10. da Cunha, Joaquim J. & de Souza, Mauricio C., 2018. "A linearized model for academic staff assignment in a Brazilian university focusing on performance gain in quality indicators," International Journal of Production Economics, Elsevier, vol. 197(C), pages 43-51.
    11. Ceschia, Sara & Di Gaspero, Luca & Schaerf, Andrea, 2023. "Educational timetabling: Problems, benchmarks, and state-of-the-art results," European Journal of Operational Research, Elsevier, vol. 308(1), pages 1-18.
    12. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    13. Al-Yakoob, Salem M. & Sherali, Hanif D., 2007. "A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1028-1044, August.
    14. Salem Al-Yakoob & Hanif Sherali, 2015. "A column generation mathematical programming approach for a class-faculty assignment problem with preferences," Computational Management Science, Springer, vol. 12(2), pages 297-318, April.
    15. Lü, Zhipeng & Hao, Jin-Kao, 2010. "Adaptive Tabu Search for course timetabling," European Journal of Operational Research, Elsevier, vol. 200(1), pages 235-244, January.
    16. Christian Ackermann & Felix Hahne & Julia Rieck, 2022. "Matching and Scheduling of Student-Company-Talks for a University IT-Speed Dating Event," SN Operations Research Forum, Springer, vol. 3(3), pages 1-29, September.
    17. Eryk Szwarc & Grzegorz Bocewicz & Paulina Golińska-Dawson & Zbigniew Banaszak, 2023. "Proactive Operations Management: Staff Allocation with Competence Maintenance Constraints," Sustainability, MDPI, vol. 15(3), pages 1-20, January.
    18. Katarína Cechlárová & Ágnes Cseh & Zsuzsanna Jankó & Marián Kireš & Lukáš Miňo, 2023. "A quest for a fair schedule: The International Young Physicists’ Tournament," Journal of Scheduling, Springer, vol. 26(1), pages 3-18, February.

    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:gam:jmathe:v:9:y:2021:i:19:p:2500-:d:650657. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.