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

Christian Ackermann (), Felix Hahne () and Julia Rieck ()
Additional contact information
Christian Ackermann: University of Hildesheim
Felix Hahne: University of Hildesheim
Julia Rieck: University of Hildesheim

SN Operations Research Forum, 2022, vol. 3, issue 3, 1-29

Abstract: 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.

Keywords: Matching and scheduling; Modified stepping stone method; Mixed-integer linear programming; Monte Carlo tree search; Genetic algorithm (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-022-00144-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:snopef:v:3:y:2022:i:3:d:10.1007_s43069-022-00144-w

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-022-00144-w

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().