Matching and scheduling of student-company-talks for a university it-speed dating event

DOI10.1007/S43069-022-00144-WMaRDI QIDQ2167666zbMATH OpenOpenAlexFDO

Authors Christian Ackermann, Felix Hahne, Julia Rieck

Publication date 25 August 2022

Published in SN Operations Research Forum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s43069-022-00144-w

zbMATH Keywords

genetic algorithmmatching and schedulingmixed integer linear programmingmodified stepping stone methodMonte Carlo tree search

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Preference-based assignment of university students to multiple teaching groups
• Profile-based optimal matchings in the student/project allocation problem
• scientific article; zbMATH DE number 1305096
• A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
• Algorithms and Computation

Cites work

• A new solution to the random assignment problem.
• A self-guided genetic algorithm for permutation flowshop scheduling problems
• Efficient algorithms for finding maximum matching in graphs
• Efficient lottery design
• Fairness and rank-weighted utilitarianism in resource allocation
• Fairness in academic course timetabling
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Linear-time approximation for maximum weight matching
• Lotteries in student assignment: an equivalence result
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• Maximal Flow Through a Network
• On a class of capacitated transportation problems
• On a conjecture by Gale about one-sided matching problems
• Open Shop Scheduling to Minimize Finish Time
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• RobinX: a three-field classification and unified data format for round-robin sports timetabling
• Scheduling a non-professional indoor football league: a tabu search based approach
• Scheduling in sports: an annotated bibliography
• Scheduling non-professional table-tennis leagues
• Scheduling the South American qualifiers to the 2018 FIFA world cup by integer programming
• Serial dictatorship and Pareto optimality
• The Economics of Matching: Stability and Incentives
• The stepping stone method of explaining linear programming calculations in transportation problems
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Three remarks on the many-to-many stable matching problem

This page was built for publication: Matching and scheduling of student-company-talks for a university it-speed dating event

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2167666)