{"id":714,"date":"2021-11-24T15:00:46","date_gmt":"2021-11-24T14:00:46","guid":{"rendered":"https:\/\/www.hsu-hh.de\/or\/?page_id=714"},"modified":"2025-10-21T15:22:55","modified_gmt":"2025-10-21T13:22:55","slug":"jaehn","status":"publish","type":"page","link":"https:\/\/www.hsu-hh.de\/or\/jaehn","title":{"rendered":"Prof. Dr. Florian Jaehn"},"content":{"rendered":"\n

Professurinhaber<\/h2>\n\n\n\n
\"Florian<\/figure>
\n

<\/p>\n<\/div><\/div>\n\n\n\n

Postanschrift:<\/strong>
Helmut-Schmidt-Universit\u00e4t
Institut f\u00fcr Management Science und Operations Research
Postfach 700822
22008 Hamburg<\/p>\n\n\n\n

Kurzvita<\/h2>\n\n\n\n

Florian Jaehn erhielt von der Universit\u00e4t Dortmund (jetzt TU<\/abbr> Dortmund) den Abschluss als Diplom-Wirtschaftsmathematiker (2005) und von der FernUniversit\u00e4t in Hagen den Abschluss als Diplom-Kaufmann (2007). Seine von Prof.<\/abbr> Dr.<\/abbr> Erwin Pesch betreute Promotion schloss er 2007 an der Universit\u00e4t Siegen ab. An der gleichen Universit\u00e4t habilitierte er sich im Jahr 2011. Im Mai 2012 wurde er zum Universit\u00e4tsprofessor an der Universit\u00e4t Augsburg ernannt, und er f\u00fchrte fortan den Lehrstuhl f\u00fcr Sustainable Operations and Logistics<\/em>. Einen parallelen Ruf an die FernUniversit\u00e4t in Hagen lehnte er ab. Der Wechsel auf seine jetzige Position an der Helmut-Schmidt-Universit\u00e4t erfolgte im Oktober 2017.<\/p>\n\n\n\n

<\/p>\n\n\n\n

Publikationen<\/h2>\n\n\n\n


Aufs\u00e4tze in begutachteten Zeitschriften und Proceedings<\/em>
<\/h2>\n\n\n\n

Jaehn, F., Meissner, F. & Neumann, S.<\/strong> (2025). Determining airplane boarding groups. OR Spectrum<\/em>.
https:\/\/doi.org\/10.1007\/s00291-025-00829-8<\/a><\/p>\n\n\n\n


Jaehn, F., Wensing, T., Wiedra, F.<\/strong> (2026). Decision making in Roll-on\/Roll-off operations. Omega<\/em>, 138, 103396.
https:\/\/doi.org\/10.1016\/j.omega.2025.103396<\/a><\/p>\n\n\n\n


Fauv\u00e9 N., Jaehn F., Golak J., G\u00fcl Y., Koch P., Neumann S., Kirchheim A., Nehrke L.<\/strong> (2024). Optimierung der Auslagerungsprozesse in automatisierten Kompaktlagern. dtec.bw-Beitr\u00e4ge, 100.
https:\/\/doi.org\/10.24405\/16768<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong> (2024). Scheduling with jobs at fixed positions. European Journal of Operational Research, 318(2), 388-397.
https:\/\/doi.org\/10.1016\/j.ejor.2024.05.029<\/a><\/p>\n\n\n\n


Bar-Gera H., Bijvank M., Jaehn, F., Neumann S., Transchel S.<\/strong> (2024). The future of transport: Coordination in a new field between public and private transport. European Journal of Operational Research, 317(3), 643-645.
https:\/\/doi.org\/10.1016\/j.ejor.2024.05.008<\/a><\/p>\n\n\n\n


Bachmat, E., Erland, S., Jaehn, F., Neumann, S.<\/strong> (2023). Air passenger preferences: An international comparison affects boarding theory. Operations Research, 71(3), 798-820.
https:\/\/doi.org\/10.1287\/opre.2021.2148<\/a><\/p>\n\n\n\n


Caballero, W. N., Jaehn, F., Lunday, B. J.<\/strong> (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<\/a><\/p>\n\n\n\n


Gertheiss, J., Jaehn, F.<\/strong> (2022). Route Planning Under Uncertainty: A Case Study on Objectives Apart from Mean Travel Time. In: International Conference on Operations Research (pp. 261\u2013267). Springer, Cham.
https:\/\/doi.org\/10.1007\/978-3-031-08623-6_39<\/a><\/p>\n\n\n\n


Jaehn, F., Meissner, F.<\/strong> (2022). The rebound effect in transportation. Omega, 108, 102563.
https:\/\/doi.org\/10.1016\/j.omega.2021.102563<\/a><\/p>\n\n\n\n


Fauv\u00e9, N., Jaehn, F., Azizpour, M., Hein, B., Kirchheim, A., Neumann, S.<\/strong> (2022). Technische und methodische Analyse von automatisierten Kompaktlagern. Forschungsaktivit\u00e4ten im Zentrum f\u00fcr Digitalisierungs- und Technologieforschung der Bundeswehr dtec.bw.
https:\/\/doi.org\/10.24405\/14541<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong>, Wiehl, A.<\/strong> (2020). Approximation algorithms for the twin robots scheduling problem. Journal of Scheduling, Volume 23, S. 117-133.
https:\/\/doi.org\/10.1007\/s10951-019-00631-9<\/a><\/p>\n\n\n\n


Billing, C., Jaehn, F.<\/strong>, Wensing, T. <\/strong>(2020). Fair task allocation problem. Annals of Operations Research, Volume 284, S. 131-146.
https:\/\/doi.org\/10.1007\/s10479-018-3052-3<\/a><\/p>\n\n\n\n


Hutter, L., Jaehn, F., Neumann, S.<\/strong> (2019). Influencing Factors on Airplane Boarding Times. Omega, Volume 87, S. 177-190.
https:\/\/doi.org\/10.1016\/j.omega.2018.09.002<\/a><\/p>\n\n\n\n


Kre\u00df, D., Dornseifer, J., Jaehn, F.<\/strong> (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<\/a><\/p>\n\n\n\n


Briskorn, D., Jaehn, F., Wiehl, A.<\/strong> (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<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong>, Juopperi, R.<\/strong> (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<\/a><\/p>\n\n\n\n


Jaehn, F., Kre\u00df, D.<\/strong> (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<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong>, Otto, A., Seifried, K.<\/strong> (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<\/a><\/p>\n\n\n\n


Ehleiter, A., Jaehn, F.<\/strong> (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<\/a><\/p>\n\n\n\n


Billing, C., Jaehn, F., Wensing, T.<\/strong> (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<\/a><\/p>\n\n\n\n


Drozdowski, M., Jaehn, F., Paszkowski, R.<\/strong> (2017). Scheduling position-dependent maintenance operations. Operations Research, Volume 65, S. 1657-1677.
https:\/\/doi.org\/10.1287\/opre.2017.1659<\/a><\/p>\n\n\n\n


Cichenski, M., Jaehn, F., Pawlak, G., Pesch, E., Singh, G., Blazewicz, J.<\/strong> (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<\/a><\/p>\n\n\n\n


Dorndorf, U., Jaehn, F., Pesch, E.<\/strong> (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<\/a><\/p>\n\n\n\n


Calinescu, G., Jaehn, F., Li, M., Wang, K.<\/strong> (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 \u2013 19:13.
https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2017.19<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong> (2016). Sustainable Operations. European Journal of Operational Research, Volume 253, S. 243-264.
https:\/\/doi.org\/10.1016\/j.ejor.2016.02.046<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong>, Sedding, H.A.<\/strong> (2016). Scheduling with time dependent discrepancy times. Journal of Scheduling, Volume 19, S. 737-757.
https:\/\/doi.org\/10.1007\/s10951-016-0472-2<\/a><\/p>\n\n\n\n


Ehleiter, A., Jaehn, F.<\/strong> (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<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong>, Michaelis, S. <\/strong>(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<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong>, Neumann, S. <\/strong>(2015). Airplane boarding. European Journal of Operational Research, Volume 244, S. 339-359.
https:\/\/doi.org\/10.1016\/j.ejor.2014.12.008<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong>, Rieder, J., Wiehl, A.<\/strong> (2015). Minimizing delays in a shunting yard. OR Spectrum, Volume 37, S. 407-429.
https:\/\/doi.org\/10.1007\/s00291-015-0391-1<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong>, Rieder, J., Wiehl, A. <\/strong>(2015). Single-stage shunting minimizing weighted departure times. Omega, Volume 52, S. 133-141.
https:\/\/doi.org\/10.1016\/J.OMEGA.2014.11.001<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong>, Kovalev, S., Kovalyov, M. Y., Pesch, E.<\/strong> (2014). Multi-product batching and scheduling with buffered rework: The case of a car paint shop. Naval Research Logistics, Volume 61, S. 458\u2013471.
https:\/\/doi.org\/10.1002\/nav.21596<\/a><\/p>\n\n\n\n


Sedding, H. A., Jaehn, F.<\/strong> (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<\/a><\/p>\n\n\n\n


Boysen, N., Fliedner, M., Jaehn, F., Pesch, E.<\/strong> (2013). A survey on container processing in railway yards. Transportation Science, Volume 47, S. 312-329.
https:\/\/doi.org\/10.1287\/trsc.1120.0415<\/a><\/p>\n\n\n\n


Briskorn, D., Jaehn, F., Pesch, E.<\/strong> (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<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong> (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<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong>, Pesch, E. <\/strong>(2013). New bounds and constraint propagation techniques for the clique partitioning problem. Discrete Applied Mathematics, Volume 161, S. 2025\u20132037.
https:\/\/doi.org\/10.1016\/j.dam.2013.02.011<\/a><\/p>\n\n\n\n


Briskorn, D., Jaehn, F.<\/strong> (2013). A note on \u201cMultistage Methods for Freight Train Classification\u201d. Networks, Volume 62, S. 80\u201381.
https:\/\/doi.org\/10.1002\/net.21498<\/a><\/p>\n\n\n\n


Boysen, N., Fliedner, M., Jaehn, F., Pesch, E.<\/strong> (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<\/a><\/p>\n\n\n\n


Boysen, N., Jaehn, F., Pesch, E.<\/strong> (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<\/a><\/p>\n\n\n\n


Dorndorf, U., Jaehn, F., Pesch, E.<\/strong> (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<\/a><\/p>\n\n\n\n


Boysen, N., Jaehn, F., Pesch, E.<\/strong> (2011). Scheduling freight trains in rail-rail transshipment yards. Transportation Science, Volume 45, S. 199-211.
https:\/\/doi.org\/10.1287\/trsc.1100.0365<\/a><\/p>\n\n\n\n


Scholz, D., Jaehn, F.<\/strong>, Junker, A.<\/strong> (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<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong>, Letmathe, P.<\/strong> (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<\/a><\/p>\n\n\n\n


Jaehn, F.<\/strong> (2010). Solving the flight gate assignment problem using dynamic programming. Zeitschrift f\u00fcr Betriebswirtschaft, Volume 80, S. 1027-1039.
https:\/\/doi.org\/10.1007\/s11573-010-0396-9<\/a><\/p>\n\n\n\n


Dorndorf, U., Jaehn, F., Pesch, E.<\/strong> (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<\/a><\/p>\n\n\n\n


Pesch, E., Jaehn, F.<\/strong> (2008). A new branch and bound algorithm for the clique partitioning problem. Operations Research Proceedings 2008, S. 457-462.<\/p>\n\n\n\n


Dorndorf, U., Jaehn, F., Lin, C., Ma, H., Pesch, E.<\/strong> (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<\/a><\/p>\n\n\n\n


Dorndorf, U., Pesch, E., Jaehn, F.<\/strong> (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.<\/p>\n\n\n\n


Lehrb\u00fccher
<\/em><\/h2>\n\n\n\n

Jaehn, F.<\/strong> (2024). Einf\u00fchrung in Operations Research. BoD \u2013 Books on Demand.
https:\/\/buchshop.bod.de\/einfuehrung-in-operations-research-florian-jaehn-9783759723444<\/a><\/p>\n\n\n\n


Jaehn, F., Pesch, E.<\/strong> (2019). Ablaufplanung: Einf\u00fchrung in Scheduling. Springer-Verlag.
https:\/\/doi.org\/10.1007\/978-3-662-58780-5<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

Professurinhaber Postanschrift:Helmut-Schmidt-Universit\u00e4tInstitut f\u00fcr Management Science und Operations ResearchPostfach 70082222008 Hamburg Kurzvita Florian Jaehn erhielt von der Universit\u00e4t Dortmund (jetzt TU Dortmund) den Abschluss als Diplom-Wirtschaftsmathematiker (2005) und von der FernUniversit\u00e4t […]<\/p>\n","protected":false},"author":2829,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"categories":[8],"tags":[],"class_list":["post-714","page","type-page","status-publish","hentry","category-team"],"_links":{"self":[{"href":"https:\/\/www.hsu-hh.de\/or\/wp-json\/wp\/v2\/pages\/714","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.hsu-hh.de\/or\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.hsu-hh.de\/or\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/or\/wp-json\/wp\/v2\/users\/2829"}],"replies":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/or\/wp-json\/wp\/v2\/comments?post=714"}],"version-history":[{"count":54,"href":"https:\/\/www.hsu-hh.de\/or\/wp-json\/wp\/v2\/pages\/714\/revisions"}],"predecessor-version":[{"id":2391,"href":"https:\/\/www.hsu-hh.de\/or\/wp-json\/wp\/v2\/pages\/714\/revisions\/2391"}],"wp:attachment":[{"href":"https:\/\/www.hsu-hh.de\/or\/wp-json\/wp\/v2\/media?parent=714"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/or\/wp-json\/wp\/v2\/categories?post=714"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/or\/wp-json\/wp\/v2\/tags?post=714"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}