IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v3y2022i3d10.1007_s43069-022-00144-w.html
   My bibliography  Save this article

Matching and Scheduling of Student-Company-Talks for a University IT-Speed Dating Event

Author

Listed:
  • Christian Ackermann

    (University of Hildesheim)

  • Felix Hahne

    (University of Hildesheim)

  • Julia Rieck

    (University of Hildesheim)

Abstract

In this paper, the IT-speed dating of a German university is considered, where students have talks with different companies in order to find a suitable internship. The goal is to create a good and fair matching of students and companies for these talks, based on student preferences, and to schedule the resulting talks in order to maintain the given time horizon and minimize the necessary room changes for the students. We solved the problem in two steps. First, we modeled the matching problem as an extended version of the capacitated transportation problem and solved it using a modified stepping stone method. Second, we present two approaches to solve the scheduling problem. A Monte Carlo tree search procedure generates time-constrained schedules with minimal duration, while a genetic algorithm generates longer schedules with individual pauses and fewer room changes. The approaches led to significantly more talks with valuable content, a shorter duration, and greater satisfaction of all participants.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:snopef:v:3:y:2022:i:3:d:10.1007_s43069-022-00144-w
    DOI: 10.1007/s43069-022-00144-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-022-00144-w
    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/s43069-022-00144-w?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. Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, American Economic Association, vol. 102(5), pages 2237-2271, August.
    2. Guido Cocchi & Alessandro Galligari & Federica Picca Nicolino & Veronica Piccialli & Fabio Schoen & Marco Sciandrone, 2018. "Scheduling the Italian National Volleyball Tournament," Interfaces, INFORMS, vol. 48(3), pages 271-284, June.
    3. Jari Kyngäs & Kimmo Nurmi & Nico Kyngäs & George Lilley & Thea Salter & Dries Goossens, 2017. "Scheduling the Australian Football League," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 973-982, August.
    4. Manea, Mihai, 2007. "Serial dictatorship and Pareto optimality," Games and Economic Behavior, Elsevier, vol. 61(2), pages 316-330, November.
    5. , A. & ,, 2011. "Lotteries in student assignment: An equivalence result," Theoretical Economics, Econometric Society, vol. 6(1), January.
    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. A. Charnes & W. W. Cooper, 1954. "The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems," Management Science, INFORMS, vol. 1(1), pages 49-69, October.
    8. Knust, Sigrid, 2010. "Scheduling non-professional table-tennis leagues," European Journal of Operational Research, Elsevier, vol. 200(2), pages 358-367, January.
    9. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    10. Van Bulck, David & Goossens, Dries & Schönberger, Jörn & Guajardo, Mario, 2020. "RobinX: A three-field classification and unified data format for round-robin sports timetabling," European Journal of Operational Research, Elsevier, vol. 280(2), pages 568-580.
    11. Sotomayor, Marilda, 1999. "Three remarks on the many-to-many stable matching problem," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 55-70, July.
    12. Guillermo Durán & Mario Guajardo & Rodrigo Wolf-Yadlin, 2012. "Operations Research Techniques for Scheduling Chile's Second Division Soccer League," Interfaces, INFORMS, vol. 42(3), pages 273-285, June.
    13. Durán, Guillermo & Guajardo, Mario & Sauré, Denis, 2017. "Scheduling the South American Qualifiers to the 2018 FIFA World Cup by integer programming," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1109-1115.
    14. Kent J. Kostuk & Keith A. Willoughby, 2012. "A Decision Support System for Scheduling the Canadian Football League," Interfaces, INFORMS, vol. 42(3), pages 286-295, June.
    15. Vangerven, Bart & Ficker, Annette M.C. & Goossens, Dries R. & Passchyn, Ward & Spieksma, Frits C.R. & Woeginger, Gerhard J., 2018. "Conference scheduling — A personalized approach," Omega, Elsevier, vol. 81(C), pages 38-47.
    16. Alvin E. Roth, 1982. "The Economics of Matching: Stability and Incentives," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 617-628, November.
    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. Guillermo Durán, 2021. "Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 125-155, April.
    2. Dries Goossens & Jeroen Beliën, 2023. "Teaching Integer Programming by Scheduling the Belgian Soccer League," INFORMS Transactions on Education, INFORMS, vol. 23(3), pages 164-172, May.
    3. David Van Bulck & Dries Goossens & Jo¨rn Scho¨nberger & Mario Guajardo, 2020. "An Instance Data Repository for the Round-robin Sports Timetabling Problem," Management and Labour Studies, XLRI Jamshedpur, School of Business Management & Human Resources, vol. 45(2), pages 184-200, May.
    4. Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, American Economic Association, vol. 102(5), pages 2237-2271, August.
    5. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
    6. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    7. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
    8. van Doornmalen, Jasper & Hojny, Christopher & Lambers, Roel & Spieksma, Frits C.R., 2023. "Integer programming models for round robin tournaments," European Journal of Operational Research, Elsevier, vol. 310(1), pages 24-33.
    9. Mennle, Timo & Seuken, Sven, 2021. "Partial strategyproofness: Relaxing strategyproofness for the random assignment problem," Journal of Economic Theory, Elsevier, vol. 191(C).
    10. Aytek Erdil, 2013. "Strategy-Proof Stochastic Assignment," Cambridge Working Papers in Economics 1333, Faculty of Economics, University of Cambridge.
    11. Erdil, Aytek, 2014. "Strategy-proof stochastic assignment," Journal of Economic Theory, Elsevier, vol. 151(C), pages 146-162.
    12. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
    13. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    14. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    15. Guillermo Durán & Mario Guajardo & Facundo Gutiérrez & Javier Marenco & Denis Sauré & Gonzalo Zamorano, 2021. "Scheduling the Main Professional Football League of Argentina," Interfaces, INFORMS, vol. 51(5), pages 361-372, September.
    16. Van Bulck, David & Goossens, Dries, 2023. "The international timetabling competition on sports timetabling (ITC2021)," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1249-1267.
    17. Itai Ashlagi & Peng Shi, 2016. "Optimal Allocation Without Money: An Engineering Approach," Management Science, INFORMS, vol. 62(4), pages 1078-1097, April.
    18. Durán, Guillermo & Durán, Santiago & Marenco, Javier & Mascialino, Federico & Rey, Pablo A., 2019. "Scheduling Argentina’s professional basketball leagues: A variation on the Travelling Tournament Problem," European Journal of Operational Research, Elsevier, vol. 275(3), pages 1126-1138.
    19. Paula Jaramillo & Çaǧatay Kayı & Flip Klijn, 2014. "On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(4), pages 793-811, April.
    20. Grenet, Julien & He, YingHua & Kübler, Dorothea, 2022. "Preference Discovery in University Admissions: The Case for Dynamic Multioffer Mechanisms," EconStor Open Access Articles and Book Chapters, ZBW - Leibniz Information Centre for Economics, vol. 130(6), pages 1-1.

    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:snopef:v:3:y:2022:i:3:d:10.1007_s43069-022-00144-w. 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.