IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v24y2022i2p727-745.html

Course Scheduling Under Sudden Scarcity: Applications to Pandemic Planning

Author

Listed:
  • Cynthia Barnhart

    (Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

  • Dimitris Bertsimas

    (Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

  • Arthur Delarue

    (Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

  • Julia Yan

    (Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

Abstract

Problem definition : Physical distancing requirements during the COVID-19 pandemic have dramatically reduced the effective capacity of university campuses. Under these conditions, we examine how to make the most of newly scarce resources in the related problems of curriculum planning and course timetabling. Academic/practical relevance : We propose a unified model for university course scheduling problems under a two-stage framework and draw parallels between component problems while showing how to accommodate individual specifics. During the pandemic, our models were critical to measuring the impact of several innovative proposals, including expanding the academic calendar, teaching across multiple rooms, and rotating student attendance through the week and school year. Methodology : We use integer optimization combined with enrollment data from thousands of past students. Our models scale to thousands of individual students enrolled in hundreds of courses. Results : We projected that if Massachusetts Institute of Technology moved from its usual two-semester calendar to a three-semester calendar, with each student attending two semesters in person, more than 90% of student course demand could be satisfied on campus without increasing faculty workloads. For the Sloan School of Management, we produced a new schedule that was implemented in fall 2020. The schedule allowed half of Sloan courses to include an in-person component while adhering to safety guidelines. Despite a fourfold reduction in classroom capacity, it afforded two thirds of Sloan students the opportunity for in-person learning in at least half their courses. Managerial implications : Integer optimization can enable decision making at a large scale in a domain that is usually managed manually by university administrators. Our models, although inspired by the pandemic, are generic and could apply to any scheduling problem under severe capacity constraints.

Suggested Citation

  • Cynthia Barnhart & Dimitris Bertsimas & Arthur Delarue & Julia Yan, 2022. "Course Scheduling Under Sudden Scarcity: Applications to Pandemic Planning," Manufacturing & Service Operations Management, INFORMS, vol. 24(2), pages 727-745, March.
  • Handle: RePEc:inm:ormsom:v:24:y:2022:i:2:p:727-745
    DOI: 10.1287/msom.2021.0996
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2021.0996
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2021.0996?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
    ---><---

    References listed on IDEAS

    as
    1. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    2. Nelishia Pillay, 2014. "A survey of school timetabling research," Annals of Operations Research, Springer, vol. 218(1), pages 261-293, July.
    3. Á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.
    4. Hoda Atef Yekta & Robert Day, 2020. "Optimization-based Mechanisms for the Course Allocation Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 641-660, July.
    5. John J. Dinkel & John Mote & M. A. Venkataramanan, 1989. "OR Practice—An Efficient Decision Support System for Academic Course Scheduling," Operations Research, INFORMS, vol. 37(6), pages 853-864, December.
    6. Moritz Mühlenthaler & Rolf Wanka, 2016. "Fairness in academic course timetabling," Annals of Operations Research, Springer, vol. 239(1), pages 171-188, April.
    7. Michael W. Carter & Craig A. Tovey, 1992. "When Is the Classroom Assignment Problem Hard?," Operations Research, INFORMS, vol. 40(1-supplem), pages 28-39, February.
    8. Gerardo Gonzalez & Christopher Richards & Alexandra Newman, 2018. "Optimal Course Scheduling for United States Air Force Academy Cadets," Interfaces, INFORMS, vol. 48(3), pages 217-234, June.
    9. Christopher Garcia, 2019. "Practice Summary: Managing Capacity at the University of Mary Washington’s College of Business," Interfaces, INFORMS, vol. 49(2), pages 167-171, March.
    10. Ofer Strichman, 2017. "Near-Optimal Course Scheduling at the Technion," Interfaces, INFORMS, vol. 47(6), pages 537-554, December.
    11. Arabinda Tripathy, 1984. "School Timetabling---A Case in Large Binary Integer Linear Programming," Management Science, INFORMS, vol. 30(12), pages 1473-1489, December.
    12. Daskalaki, S. & Birbas, T. & Housos, E., 2004. "An integer programming formulation for a case study in university timetabling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 117-135, February.
    13. Fonseca, George H.G. & Santos, Haroldo G. & Carrano, Eduardo G. & Stidsen, Thomas J.R., 2017. "Integer programming techniques for educational timetabling," European Journal of Operational Research, Elsevier, vol. 262(1), pages 28-39.
    14. D. Abramson, 1991. "Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms," Management Science, INFORMS, vol. 37(1), pages 98-113, January.
    15. Mulvey, John M., 1982. "A classroom/time assignment model," European Journal of Operational Research, Elsevier, vol. 9(1), pages 64-70, January.
    16. Jan Stallaert, 1997. "Automated Timetabling Improves Course Scheduling at UCLA," Interfaces, INFORMS, vol. 27(4), pages 67-81, August.
    17. Timothy R. Hinkin & Gary M. Thompson, 2002. "SchedulExpert: Scheduling Courses in the Cornell University School of Hotel Administration," Interfaces, INFORMS, vol. 32(6), pages 45-57, December.
    18. Haroldo Santos & Eduardo Uchoa & Luiz Ochi & Nelson Maculan, 2012. "Strong bounds with cut and column generation for class-teacher timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 399-412, April.
    19. 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.
    20. Lindahl, Michael & Mason, Andrew J. & Stidsen, Thomas & Sørensen, Matias, 2018. "A strategic view of University timetabling," European Journal of Operational Research, Elsevier, vol. 266(1), pages 35-45.
    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. Matthew Davison & Ahmed Kheiri & Konstantinos G. Zografos, 2025. "Modelling and solving the university course timetabling problem with hybrid teaching considerations," Journal of Scheduling, Springer, vol. 28(2), pages 195-215, April.
    2. Mehran Navabi-Shirazi & Mohamed El Tonbari & Natashia Boland & Dima Nazzal & Lauren N. Steimle, 2022. "Multicriteria Course Mode Selection and Classroom Assignment Under Sudden Space Scarcity," Manufacturing & Service Operations Management, INFORMS, vol. 24(6), pages 3252-3268, November.

    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. Ciamac C. Moallemi & Utkarsh Patange, 2024. "Hybrid Scheduling with Mixed-Integer Programming at Columbia Business School," Interfaces, INFORMS, vol. 54(3), pages 222-240, May.
    2. 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.
    3. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    4. Matthew Davison & Ahmed Kheiri & Konstantinos G. Zografos, 2025. "Modelling and solving the university course timetabling problem with hybrid teaching considerations," Journal of Scheduling, Springer, vol. 28(2), pages 195-215, April.
    5. 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.
    6. Cristian D. Palma & Patrick Bornhardt, 2020. "Considering Section Balance in an Integer Optimization Model for the Curriculum-Based Course Timetabling Problem," Mathematics, MDPI, vol. 8(10), pages 1-12, October.
    7. Esmaeilbeigi, Rasul & Mak-Hau, Vicky & Yearwood, John & Nguyen, Vivian, 2022. "The multiphase course timetabling problem," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1098-1119.
    8. 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.
    9. 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.
    10. Jaime Miranda, 2010. "eClasSkeduler: A Course Scheduling System for the Executive Education Unit at the Universidad de Chile," Interfaces, INFORMS, vol. 40(3), pages 196-207, June.
    11. Boronico, Jess, 2000. "Quantitative modeling and technology driven departmental course scheduling," Omega, Elsevier, vol. 28(3), pages 327-346, June.
    12. 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.
    13. Ioannis T. Christou & Evgenia Vagianou & George Vardoulias, 2024. "Planning Courses for Student Success at the American College of Greece," Interfaces, INFORMS, vol. 54(4), pages 365-379, July.
    14. Saviniec, Landir & Santos, Maristela O. & Costa, Alysson M., 2018. "Parallel local search algorithms for high school timetabling problems," European Journal of Operational Research, Elsevier, vol. 265(1), pages 81-98.
    15. Drexl, Andreas & Juretzka, Jan & Salewski, Frank, 1993. "Academic course scheduling under workload and changeover constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 337, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    16. Drexl, Andreas & Salewski, Frank, 1997. "Distribution requirements and compactness constraints in school timetabling," European Journal of Operational Research, Elsevier, vol. 102(1), pages 193-214, October.
    17. Biniyam Asmare Kassa, 2015. "Implementing a Class-Scheduling System at the College of Business and Economics of Bahir Dar University, Ethiopia," Interfaces, INFORMS, vol. 45(3), pages 203-215, June.
    18. Amy B. Gore & Mary E. Kurz & Matthew J. Saltzman & Blake Splitter & William C. Bridges & Neil J. Calkin, 2022. "Clemson University’s Rotational Attendance Plan During COVID-19," Interfaces, INFORMS, vol. 52(6), pages 553-567, November.
    19. R. Alan Bowman, 2021. "Developing Optimal Student Plans of Study," Interfaces, INFORMS, vol. 51(6), pages 409-421, November.
    20. Massimiliano Caramia & Stefano Giordani, 2020. "Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study," SN Operations Research Forum, Springer, vol. 1(2), pages 1-21, June.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:inm:ormsom:v:24:y:2022:i:2:p:727-745. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.