Professor
Postal Address:
Helmut Schmidt University
Institute for Management Science and Operations Research
Postfach 700822
22008 Hamburg
Short CV
Florian Jaehn received university degrees (diploma) in business mathematics from the TU Dortmund University (2005) and in business adminstration from FernUniversität in Hagen (2007). He finished his doctoral degree, which was supervised by Prof. Dr. Erwin Pesch, in 2007 at the University of Siegen. There, he also received his habiliation in 2011. In May 2012, he was appointed as full professor at the University of Augsburg and he held the chair for Sustainable Operations and Logistics. At the same time, he declined an offer for a professorship at the FernUniversität in Hagen. He moved to his current position at the Helmut Schmidt University in Oktober 2017.
Publications
Articles in peer-reviewed journals and proceedings
Bachmat, E., Erland, S., Jaehn, F., & Neumann, S. (2023). Air passenger preferences: An international comparison affects boarding theory. Operations Research, 71(3), 798-820.
https://doi.org/10.1287/opre.2021.2148
Caballero, W. N., Jaehn, F., and Lunday, B. J. (2022). Transportation labor cost reduction via vehicle platooning: Alternative models and solution methods. Transportation Science, 56(6), 1549-1572.
https://doi.org/10.1287/trsc.2022.1151
Gertheiss, J., and Jaehn, F. (2022). Route Planning Under Uncertainty: A Case Study on Objectives Apart from Mean Travel Time. In: International Conference on Operations Research (pp. 261–267). Springer, Cham.
https://doi.org/10.1007/978-3-031-08623-6_39
Jaehn, F., and Meissner, F. (2022). The rebound effect in transportation. Omega, 108, 102563.
https://doi.org/10.1016/j.omega.2021.102563
Fauvé, N., Jaehn, F., Azizpour, M., Hein, B., Kirchheim, A., and Neumann, S. (2022). Technische und
methodische Analyse von automatisierten Kompaktlagern. Forschungsaktivitäten im Zentrum für Digitalisierungs- und Technologieforschung der Bundeswehr dtec.bw. https://doi.org/10.24405/14541
Wiehl, A., Jaehn, F. (2020) Approximation algorithms for the twin robots scheduling problem. Journal of Sche-
duling, Volume 23, S. 117-133.
https://doi.org/10.1007/s10951-019-00631-9
Billing, C., Wensing, T., Jaehn, F. (2020) Fair task allocation problem. Annals of Operations Research, Volume 284, S. 131-
146.
https://doi.org/10.1007/s10479-018-3052-3
Hutter, L., Neumann, S., Jaehn, F. (2019) Influencing Factors on Airplane Boarding Times. Omega, Volume 87, S. 177-190.
https://doi.org/10.1016/j.omega.2018.09.002
Dornseifer, J., Kreß, D., Jaehn, F. (2019) An exact solution approach for scheduling cooperative gantry cranes. European Journal of Operational Research, Volume 273, S. 82-101.
https://doi.org/10.1016/j.ejor.2018.07.043
Briskorn, D., Wiehl, A., Jaehn, F. (2019) A generator for test instances of scheduling problems concerning cranes in transshipment terminals. OR Spectrum, Volume 41, S. 45-69.
https://doi.org/10.1007/s00291-018-0529-z
Juopperi, R., Jaehn, F. (2019) A description of supply chain planning problems in the paper industry with literature review. Asia-Pacific Journal of Operational Research, Volume 36, S. 1-39.
https://doi.org/10.1142/S0217595919500040
Kreß, D., Jaehn, F. (2018) Scheduling cooperative gantry cranes with seaside and landside jobs. Discrete Applied
Mathematics, Volume 242, S. 53-68.
https://doi.org/10.1016/j.dam.2017.06.015
Otto, A., Seifried, K., Jaehn, F. (2018) Shunting operations at flat yards: retrieving freight railcars from storage tracks. OR Spectrum, Volume 40, S. 367-393.
https://doi.org/10.1007/s00291-017-0495-x
Ehleiter, A., Jaehn, F. (2018) Scheduling crossover cranes at container terminals during seaside peak times. Journal of Heuristics, Volume 24, S. 899-932.
https://doi.org/10.1007/s10732-018-9380-2
Billing, C., Wensing, T., Jaehn, F. (2018) A multiperiod auto-carrier transportation problem with probabilistic future demands.
Journal of Business Economics, Volume 88, S. 1009-1028.
https://doi.org/10.1007/s11573-018-0904-x
Drozdowski, M., Paszkowski, R., Jaehn, F. (2017) Scheduling position-dependent maintenance operations. Operations Research, Volume 65, S. 1657-1677.
https://doi.org/10.1287/opre.2017.1659
Cichenski, M., Pawlak, G., Pesch, E., Singh, G., Blazewicz, J., Jaehn, F. (2017) An integrated model for the transshipment yard scheduling problem. Journal of Scheduling, Volume 20, S. 57-65.
https://doi.org/10.1007/s10951-016-0470-4
Dorndorf, U., Pesch, E., Jaehn, F. (2017) Flight gate assignment and recovery strategies with stochastic arrival and departure times. OR Spectrum, Volume 39, S. 65-93.
https://doi.org/10.1007/s00291-016-0443-1
Calinescu, G., Li, M., Wang, K., Jaehn, F. (2017) An FPTAS of minimizing total weighted completion time on single Machine with Position Constraint. Leibniz International Proceedings in Informatics (LIPIcs), The 28th International Symposium on Algorithms and Computation (ISAAC), 19:1 – 19:13.
https://doi.org/10.4230/LIPIcs.ISAAC.2017.19
Jaehn, F. (2016) Sustainable Operations. European Journal of Operational Research, Volume 253, S. 243-264.
https://doi.org/10.1016/j.ejor.2016.02.046
Sedding, H. A., Jaehn, F. (2016) Scheduling with time dependent discrepancy times. Journal of Scheduling, Volume 19, S. 737-757.
https://doi.org/10.1007/s10951-016-0472-2
Ehleiter, A., Jaehn, F. (2016) Housekeeping: Foresightful container repositioning. International Journal of Production Economics, Volume 179, S. 203-211.
https://doi.org/10.1016/j.ijpe.2016.06.009
Michaelis, S., Jaehn, F. (2016) Shunting of trains in succeeding yards. Computers and Industrial Engineering, Volume 102, S. 1-9.
https://doi.org/10.1016/j.cie.2016.10.006
Neumann, S., Jaehn, F. (2015) Airplane boarding. European Journal of Operational Research, Volume 244, S. 339-359.
https://doi.org/10.1016/j.ejor.2014.12.008
Rieder, J., Wiehl, A., Jaehn, F. (2015) Minimizing delays in a shunting yard. OR Spectrum, Volume 37, S. 407-429.
https://doi.org/10.1007/s00291-015-0391-1
Rieder, J., Wiehl, A., Jaehn, F. (2015) Single-stage shunting minimizing weighted departure times. Omega, Volume 52, S. 133-141.
https://doi.org/10.1016/J.OMEGA.2014.11.001
Kovalev, S., Kovalyov, M. Y., Pesch, E., Jaehn, F. (2014) Multi-product batching and scheduling with buffered rework: The case of a car paint
shop. Naval Research Logistics, Volume 61, S. 458–471.
https://doi.org/10.1002/nav.21596
Sedding, H. A., Jaehn, F. (2014) Single machine scheduling with nonmonotonic piecewise linear time dependent processing times. Proceedings of the 14th International Conference on Project Management and Scheduling, S. 222-225.
https://mediatum.ub.tum.de/doc/1254091/document.pdf#page=223
Boysen, N., Fliedner, M., Pesch, E., Jaehn, F. (2013) A survey on container processing in railway yards. Transportation Science, Volume
47, S. 312-329.
https://doi.org/10.1287/trsc.1120.0415
Briskorn, D., Pesch, E., Jaehn, F. (2013) Exact algorithms for inventory constrained scheduling on a single machine. Journal of
Scheduling, Volume 16, S. 105-115.
https://doi.org/10.1007/s10951-011-0261-x
Jaehn, F. (2013) Positioning of loading units in a transshipment yard storage area. OR Spectrum, Volume 35, S. 399-416.
https://doi.org/10.1007/s00291-012-0281-8
Pesch, E., Jaehn, F. (2013) New bounds and constraint propagation techniques for the clique partitioning problem. Discrete Applied Mathematics, Volume 161, S. 2025–2037.
https://doi.org/10.1016/j.dam.2013.02.011
Briskorn, D., Jaehn, F. (2013) A note on “Multistage Methods for Freight Train Classification”. Networks, Volume 62, S. 80–81.
https://doi.org/10.1002/net.21498
Boysen, N., Fliedner, M., Pesch, E., Jaehn, F. (2012) Shunting yard operations: Theoretical aspects and applications. European Journal
of Operational Research, Volume, S. 1-14.
https://doi.org/10.1016/j.ejor.2012.01.043
Boysen, N., Pesch, E., Jaehn, F. (2012) New bounds and algorithms for the transshipment yard scheduling problem. Journal
of Scheduling, Volume 15, S. 499-511.
https://doi.org/10.1007/s10951-010-0200-2
Dorndorf, U., Pesch, E., Jaehn, F. (2012) Flight gate scheduling with respect to a reference schedule. Annals of Operations
Research, Volume 194, S. 177-187.
https://doi.org/10.1007/s10479-010-0809-8
Boysen, N., Pesch, E., Jaehn, F. (2011) Scheduling freight trains in rail-rail transshipment yards. Transportation Science,
Volume 45, S. 199-211.
https://doi.org/10.1287/trsc.1100.0365
Junker, A., Scholz, D., Jaehn, F. (2010) Extensions to STaTS for practical applications of the facility layout problem. European Journal of Operational Research, Volume 204, S. 463-472.
https://doi.org/10.1016/j.ejor.2009.11.012
Letmathe, P., Jaehn, F. (2010) The emissions trading paradox. European Journal of Operational Research, Volume 202, S. 248-254.
https://doi.org/10.1016/j.ejor.2009.05.007
Jaehn, F. (2010) Solving the flight gate assignment problem using dynamic programming. Zeitschrift für Betriebswirtschaft, Volume 80, S. 1027-1039.
https://doi.org/10.1007/s11573-010-0396-9
Dorndorf, U., Pesch, E., Jaehn, F. (2008) Modelling robust flight gate scheduling as a clique partitioning problem. Transportation Science, Volume 42, S. 292-301.
https://doi.org/10.1287/trsc.1070.0211
Pesch, E., Jaehn, F. (2008) A new branch and bound algorithm for the clique partitioning problem. Operations Research Proceedings 2008, S. 457-462.
Dorndorf, U., Lin, C., Ma, H., Pesch, E., Jaehn, F. (2007) Disruption management in flight gate scheduling. Statistica Neerlandica, Volume 61,
S. 92-114.
https://doi.org/10.1111/j.1467-9574.2007.00361.x
Dorndorf, U., Pesch, E., Jaehn, F. (2006) Modeling robust flight gate scheduling as a clique partitioning problem. Proceedings of the 10th International Workshop on Project Management and Scheduling, S. 175-179.
Letzte Änderung: 7. February 2024