IDEAS home Printed from https://ideas.repec.org/a/spr/jbecon/v87y2017i7d10.1007_s11573-017-0858-4.html
   My bibliography  Save this article

Allocation of seminar applicants

Author

Listed:
  • Andreas Kleine

    (FernUniversität in Hagen)

  • Andreas Dellnitz

    (FernUniversität in Hagen)

Abstract

The allocation of seminar applicants is an important issue in educational planning, and each semester a university administration has to deal with this kind of problem. The task here is to reconcile the preferences and priorities of the students, professorships and the university administration itself. This paper shows that if the planning procedure is based on a simple selection strategy, the capacity utilization can be suboptimal; this result is evidenced by a simulation study. To remedy this deficit—and to justify the respective interests—we propose a mixed-integer goal programming approach for assigning students to seminar courses. In addition, we show that this problem can be reformulated into a linear one. All investigations in this paper are illustrated by a real-world application for the University of Hagen, Germany.

Suggested Citation

  • Andreas Kleine & Andreas Dellnitz, 2017. "Allocation of seminar applicants," Journal of Business Economics, Springer, vol. 87(7), pages 927-941, October.
    • Handle: RePEc:spr:jbecon:v:87:y:2017:i:7:d:10.1007_s11573-017-0858-4
    DOI: 10.1007/s11573-017-0858-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11573-017-0858-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/s11573-017-0858-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. Sang M. Lee & Marc J. Schniederjans, 1983. "A Multicriteria Assignment Problem: A Goal Programming Approach," Interfaces, INFORMS, vol. 13(4), pages 75-81, August.
    2. 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.
    3. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    4. Saber, Hussein M. & Ghosh, Jay B., 2001. "Assigning students to academic majors," Omega, Elsevier, vol. 29(6), pages 513-523, December.
    5. Breslaw, Jon A., 1976. "A linear programming solution to the faculty assignment problem," Socio-Economic Planning Sciences, Elsevier, vol. 10(6), pages 227-230.
    6. Cattrysse, Dirk G. & Van Wassenhove, Luk N., 1992. "A survey of algorithms for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 60(3), pages 260-272, August.
    7. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    8. A. Charnes & W. W. Cooper & R. O. Ferguson, 1955. "Optimal Estimation of Executive Compensation by Linear Programming," Management Science, INFORMS, vol. 1(2), pages 138-151, January.
    9. 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.
    10. 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.
    11. Przybylski, Anthony & Gandibleux, Xavier & Ehrgott, Matthias, 2008. "Two phase algorithms for the bi-objective assignment problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 509-533, March.
    12. Dylan Jones & Mehrdad Tamiz, 2010. "Practical Goal Programming," International Series in Operations Research and Management Science, Springer, edition 1, number 978-1-4419-5771-9, December.
    13. Tillett, P. I., 1975. "An operations research approach to the assignment of teachers to courses," Socio-Economic Planning Sciences, Elsevier, vol. 9(3-4), pages 101-104, June.
    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. 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.

    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. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    3. 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.
    4. Sana Bouajaja & Najoua Dridi, 2017. "A survey on human resource allocation problem and its applications," Operational Research, Springer, vol. 17(2), pages 339-369, July.
    5. 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).
    6. Mila Bravo & Dylan Jones & David Pla-Santamaria & Francisco Salas-Molina, 2022. "Encompassing statistically unquantifiable randomness in goal programming: an application to portfolio selection," Operational Research, Springer, vol. 22(5), pages 5685-5706, November.
    7. Stamenkovska, Ivana Janeska & Dimitrievski, Dragi & Erjavec, Emil & Stojcheska, Aleksandra Martinovska & Zgajnar, Jaka, 2014. "A weighted goal programming model for vegetable production planning in Republic of Macedonia," 2014 International Congress, August 26-29, 2014, Ljubljana, Slovenia 182967, European Association of Agricultural Economists.
    8. 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.
    9. Talmor, Irit, 2022. "Solving the problem of maximizing diversity in public sector teams," Socio-Economic Planning Sciences, Elsevier, vol. 81(C).
    10. Hashem Omrani & Mahsa Valipour & Ali Emrouznejad, 2019. "Using Weighted Goal Programming Model for Planning Regional Sustainable Development to Optimal Workforce Allocation: An Application for Provinces of Iran," Social Indicators Research: An International and Interdisciplinary Journal for Quality-of-Life Measurement, Springer, vol. 141(3), pages 1007-1035, February.
    11. Junzo Watada & Nureize Binti Arbaiy & Qiuhong Chen, 2021. "Hybrid Uncertainty-Goal Programming Model with Scaled Index for Production Planning Assessment," FinTech, MDPI, vol. 1(1), pages 1-24, November.
    12. Zheng, Feifeng & Cheng, Yongxi & Xu, Yinfeng & Liu, Ming, 2013. "Competitive strategies for an online generalized assignment problem with a service consecution constraint," European Journal of Operational Research, Elsevier, vol. 229(1), pages 59-66.
    13. Benítez-Fernández, Amalia & Ruiz, Francisco, 2020. "A Meta-Goal Programming approach to cardinal preferences aggregation in multicriteria problems," Omega, Elsevier, vol. 94(C).
    14. Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
    15. 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.
    16. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
    17. Chang, Ching-Ter, 2011. "Multi-choice goal programming with utility functions," European Journal of Operational Research, Elsevier, vol. 215(2), pages 439-445, December.
    18. Danilo Liuzzi & Veronica Lupi & Aymeric Vié, 2022. "Sustainability, cooperation and mobility of workers within and between European countries: a two-stage goal programming model," Annals of Operations Research, Springer, vol. 311(2), pages 749-769, April.
    19. Seizinger, Markus & Brunner, Jens O., 2023. "Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1223-1241.
    20. Matusiak, Marek & de Koster, René & Saarinen, Jari, 2017. "Utilizing individual picker skills to improve order batching in a warehouse," European Journal of Operational Research, Elsevier, vol. 263(3), pages 888-899.

    More about this item

    Keywords

    Seminar assignment; Educational planning; Goal programming; Multi-objective assignment;
    All these keywords.

    JEL classification:

    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    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:spr:jbecon:v:87:y:2017:i:7:d:10.1007_s11573-017-0858-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.