IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v37y1989i6p853-864.html
   My bibliography  Save this article

OR Practice—An Efficient Decision Support System for Academic Course Scheduling

Author

Listed:
  • John J. Dinkel

    (Texas A&M University, College Station, Texas)

  • John Mote

    (The University of Texas, Austin, Texas)

  • M. A. Venkataramanan

    (Indiana University, Bloomington, Indiana)

Abstract

This paper describes a network-based decision support system approach to the most general form of the academic course scheduling problem. The dimensions of faculty, subject, time, and room are considered by incorporating a penalty function into a network optimization approach. The approach, based on a network algorithm, is capable of solving very large problems. This methodology can be applied to other scheduling situations where there are competing objectives and multiple resources. Such situations include: scheduling of exams, times, and rooms in an academic setting, and scheduling of clients, times, and facilities for physicians, hospitals, dentists, counselors, and clinics. Common problems in such settings include the utilization of available space, and dissatisfaction with assigned times and locations. The proposed system results in more effective room utilization patterns, improved instructor satisfaction levels, and streamlines the tedious scheduling process. We describe the use of the model to schedule all graduate and undergraduate courses in the College of Business Administration at Texas A&M University. This involves 175 faculty, over 300 sections, 20 rooms, and 16 time slots for each semester's scheduling problem.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:37:y:1989:i:6:p:853-864
    DOI: 10.1287/opre.37.6.853
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.37.6.853
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.37.6.853?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
    ---><---

    Citations

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


    Cited by:

    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. 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.
    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. Badri, Masood A., 1996. "A two-stage multiobjective scheduling model for [faculty-course-time] assignments," European Journal of Operational Research, Elsevier, vol. 94(1), pages 16-28, October.
    5. Dimopoulou, M. & Miliotis, P., 2004. "An automated university course timetabling system developed in a distributed environment: A case study," European Journal of Operational Research, Elsevier, vol. 153(1), pages 136-147, February.
    6. Andrei STANCIU & Mihai FLORIN & Cristina RADULESCU & Ofelia ALECA, 2009. "Solutions for decision support in university management," Economia. Seria Management, Faculty of Management, Academy of Economic Studies, Bucharest, Romania, vol. 12(1), pages 136-151, June.
    7. 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.
    8. 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.
    9. 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.
    10. Mustafa, A. & Goh, M., 1996. "Multi-criterion models for higher education administration," Omega, Elsevier, vol. 24(2), pages 167-178, April.
    11. 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.
    12. Boronico, Jess, 2000. "Quantitative modeling and technology driven departmental course scheduling," Omega, Elsevier, vol. 28(3), pages 327-346, June.
    13. 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.
    14. Janice K. Winch & Jack Yurkiewicz, 2014. "Case Article—Class Scheduling with Linear Programming," INFORMS Transactions on Education, INFORMS, vol. 15(1), pages 143-147, September.
    15. Partovi, Fariborz Y. & Arinze, Bay, 1995. "A knowledge based approach to the faculty-course assignment problem," Socio-Economic Planning Sciences, Elsevier, vol. 29(3), pages 245-256, September.
    16. 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.

    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:oropre:v:37:y:1989:i:6:p:853-864. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.