Abstract
Every student in North Rhine-Westphalia, Germany, studying to become a teacher, has to complete a semester of practical training at a school. In order to assign students to schools and thereby satisfy the requests of the students, without exceeding capacity limitations at the schools, a discrete, assignment-like optimization problem is formulated and solved to optimality. Since students study two major subjects, a school has to provide capacities in both of them to be a candidate for a feasible assignment. An additional requirement comes from the fact that students have to attend seminar courses in the respective subjects during their internship. The overall optimization problem is a generalized assignment problem, which has an alternative interpretation as a fixed-charge multicommodity flow problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
PVP website (German) https://www.pvp-nrw.uni-wuppertal.de/ueber-pvp.html.
- 2.
Zentrum für schulpraktische Lehrerausbildung.
- 3.
References
Assad, A.: Multicommodity network flows – a survey. Networks 8, 37–91 (1978)
Chouman, M., Crainic, T.G., Gendron, B.: A branch-and-cut algorithm for multicommodity capacitated fixed charge network design. Technical report, Université de Montréal (2008)
Hirsch, W.M., Dantzig, G.B.: The fixed charge problem. Naval Res. Logist. Q. 15(3), 413–424 (1968). https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.3800150306
Kim, D., Pardalos, P.M.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4), 195–203 (1999)
Ministerium für Schule und Bildung des Landes Nordrhein-Westfalen: Das Bildungsportal: Lehrkraft in Nordrhein-Westfalen (2018). https://www.schulministerium.nrw.de/docs/LehrkraftNRW/Lehramtsstudium/Praxiselemente/Praxissemester/index.html. Accessed 09 Jul 2018
Murty, K.G.: Solving the fixed charge problem by ranking the extreme points. Oper. Res. 16(2), 268–279 (1968). http://www.jstor.org/stable/168755
Nahapetyan, A.G., Pardalos, P.M.: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Comput. Optim. Appl. 39(1), 37–50 (2008). http://dx.doi.org/10.1007/s10589-007-9060-x
Ortega, F., Wolsey, L.A.: A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41(3), 143–158 (2003). http://dx.doi.org/10.1002/net.10068
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Stiglmayr, M., Görtz, S., Klamroth, K. (2019). Assigning Students to Schools for an Internship. In: Fortz, B., Labbé, M. (eds) Operations Research Proceedings 2018. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-18500-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-18500-8_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18499-5
Online ISBN: 978-3-030-18500-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)