IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v53y2023i4p307-311.html
   My bibliography  Save this article

Practice Summary: Seminar Assignments in a University—MATLAB-Based Decision Support

Author

Listed:
  • Andreas Dellnitz

    (Department of Business Administration, Leibniz University of Applied Sciences, 30539 Hannover, Germany)

  • Damian Pozo

    (Department of Business Administration and Economics, FernUniversitat in Hagen, 58084 Hagen, Germany)

  • Jochen Bauer

    (Department of Business Administration and Economics, FernUniversitat in Hagen, 58084 Hagen, Germany)

  • Andreas Kleine

    (Department of Business Administration and Economics, FernUniversitat in Hagen, 58084 Hagen, Germany)

Abstract

Universities follow a long tradition of assigning students to courses based on student preferences while taking into account constraints such as the rooms to be used. In this context, theoretical approaches aid us in developing algorithms that can be helpful in practice. Our contribution to this subject is a practice summary in which we discuss the most important findings of a project to develop a MATLAB-based stand-alone software system to solve the seminar assignment problem at the FernUniversität in Hagen, Germany. The use of our software at three departments has already enabled annual savings of nearly 20,000 euros in personnel costs, which corresponds to a reduction of around 500 person-hours per year. Apart from important technical aspects of our work, the reported savings potential provides valuable information for making decisions on future similar software projects.

Suggested Citation

  • Andreas Dellnitz & Damian Pozo & Jochen Bauer & Andreas Kleine, 2023. "Practice Summary: Seminar Assignments in a University—MATLAB-Based Decision Support," Interfaces, INFORMS, vol. 53(4), pages 307-311, July.
    • Handle: RePEc:inm:orinte:v:53:y:2023:i:4:p:307-311
    DOI: 10.1287/inte.2023.1157
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2023.1157
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2023.1157?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. 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.
    2. Andreas Kleine & Andreas Dellnitz, 2017. "Allocation of seminar applicants," Journal of Business Economics, Springer, vol. 87(7), pages 927-941, October.
    3. 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.
    4. Krumke, Sven O. & Thielen, Clemens, 2013. "The generalized assignment problem with minimum quantities," European Journal of Operational Research, Elsevier, vol. 228(1), pages 46-55.
    5. J. Kennington & Z. Wang, 1992. "A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem," Operations Research, INFORMS, vol. 40(1), pages 178-187, February.
    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. Andreas Kleine & Andreas Dellnitz, 2017. "Allocation of seminar applicants," Journal of Business Economics, Springer, vol. 87(7), pages 927-941, October.
    2. 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.
    3. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    4. Volgenant, A., 2004. "A note on the assignment problem with seniority and job priority constraints," European Journal of Operational Research, Elsevier, vol. 154(1), pages 330-335, April.
    5. Ioannis T. Christou & Armand Zakarian & Jun-Min Liu & Helen Carter, 1999. "A Two-Phase Genetic Algorithm for Large-Scale Bidline-Generation Problems at Delta Air Lines," Interfaces, INFORMS, vol. 29(5), pages 51-65, October.
    6. 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.
    7. Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.
    8. Jonker, R. & Volgenant, A., 1999. "Linear assignment procedures," European Journal of Operational Research, Elsevier, vol. 116(1), pages 233-234, July.
    9. Prabhjot Kaur & Kalpana Dahiya & Vanita Verma, 2021. "Time-cost trade-off analysis of a priority based assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 448-482, June.
    10. Yuli Zhang & Zuo-Jun Max Shen & Shiji Song, 2018. "Exact Algorithms for Distributionally β -Robust Machine Scheduling with Uncertain Processing Times," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 662-676, November.
    11. Volgenant, A., 2004. "Solving the k-cardinality assignment problem by transformation," European Journal of Operational Research, Elsevier, vol. 157(2), pages 322-331, September.
    12. Marco Chiarandini & Rolf Fagerberg & Stefano Gualandi, 2019. "Handling preferences in student-project allocation," Annals of Operations Research, Springer, vol. 275(1), pages 39-78, April.
    13. Wang, Dian & Zhao, Jun & Peng, Qiyuan, 2022. "Optimizing the loaded train combination problem at a heavy-haul marshalling station," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 162(C).
    14. 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.
    15. Jorge Amaya & Dominique Peeters & Paula Uribe & Juan P. Valenzuela, 2016. "Optimization Modeling for Resource Allocation in the Chilean Public Education System," International Regional Science Review, , vol. 39(2), pages 155-176, April.
    16. Gartner, Daniel & Kolisch, Rainer, 2021. "Mathematical programming for nominating exchange students for international universities: The impact of stakeholders’ objectives and fairness constraints on allocations," Socio-Economic Planning Sciences, Elsevier, vol. 76(C).

    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:orinte:v:53:y:2023:i:4:p:307-311. 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.