default search action
Florian Jaehn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j32]Hillel Bar-Gera
, Marco Bijvank, Florian Jaehn
The future of transport: Coordination in a new field between public and private transport. Eur. J. Oper. Res. 317(3): 643-645 (2024) - [j31]Florian Jaehn
Scheduling with jobs at fixed positions. Eur. J. Oper. Res. 318(2): 388-397 (2024) - 2023
- [j30]Eitan Bachmat
Air Passenger Preferences: An International Comparison Affects Boarding Theory. Oper. Res. 71(3): 798-820 (2023) - 2022
- [j29]William N. Caballero
Transportation Labor Cost Reduction via Vehicle Platooning: Alternative Models and Solution Methods. Transp. Sci. 56(6): 1549-1572 (2022) - 2021
- [c2]Jan Gertheiss, Florian Jaehn:
Route Planning Under Uncertainty: A Case Study on Objectives Apart from Mean Travel Time. OR 2021: 261-267 - 2020
- [j28]Christian Billing, Florian Jaehn
Fair task allocation problem. Ann. Oper. Res. 284(1): 131-146 (2020) - [j27]Florian Jaehn
Approximation algorithms for the twin robot scheduling problem. J. Sched. 23(1): 117-133 (2020)
2010 – 2019
- 2019
- [j26]Florian Jaehn, Raisa Juopperi:
A Description of Supply Chain Planning Problems in the Paper Industry with Literature Review. Asia Pac. J. Oper. Res. 36(1): 1950004:1-1950004:39 (2019) - [j25]Dominik Kress
An exact solution approach for scheduling cooperative gantry cranes. Eur. J. Oper. Res. 273(1): 82-101 (2019) - [j24]Dirk Briskorn
A generator for test instances of scheduling problems concerning cranes in transshipment terminals. OR Spectr. 41(1): 45-69 (2019) - 2018
- [j23]Florian Jaehn, Dominik Kress
Scheduling cooperative gantry cranes with seaside and landside jobs. Discret. Appl. Math. 242: 53-68 (2018) - [j22]Anne Ehleiter, Florian Jaehn
Scheduling crossover cranes at container terminals during seaside peak times. J. Heuristics 24(6): 899-932 (2018) - [j21]Florian Jaehn, Alena Otto
Shunting operations at flat yards: retrieving freight railcars from storage tracks. OR Spectr. 40(2): 367-393 (2018) - 2017
- [j20]Maciej Drozdowski
Scheduling Position-Dependent Maintenance Operations. Oper. Res. 65(6): 1657-1677 (2017) - [j19]Ulrich Dorndorf, Florian Jaehn, Erwin Pesch:
Flight gate assignment and recovery strategies with stochastic arrival and departure times. OR Spectr. 39(1): 65-93 (2017) - [j18]Mateusz Cichenski, Florian Jaehn, Grzegorz Pawlak
An integrated model for the transshipment yard scheduling problem. J. Sched. 20(1): 57-65 (2017) - [c1]Gruia Calinescu
An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint. ISAAC 2017: 19:1-19:13 - [i1]Gruia Calinescu, Florian Jaehn, Minming Li, Kai Wang:
An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint. CoRR abs/1710.10904 (2017) - 2016
- [j17]Florian Jaehn, Steffen Michaelis:
Shunting of trains in succeeding yards. Comput. Ind. Eng. 102: 1-9 (2016) - [j16]Florian Jaehn:
Sustainable Operations. Eur. J. Oper. Res. 253(2): 243-264 (2016) - [j15]Florian Jaehn, Helmut A. Sedding
Scheduling with time-dependent discrepancy times. J. Sched. 19(6): 737-757 (2016) - 2015
- [j14]Florian Jaehn, Simone Neumann
Airplane boarding. Eur. J. Oper. Res. 244(2): 339-359 (2015) - [j13]Florian Jaehn, Johannes Rieder, Andreas Wiehl:
Minimizing delays in a shunting yard. OR Spectr. 37(2): 407-429 (2015) - 2013
- [j12]Florian Jaehn, Erwin Pesch:
New bounds and constraint propagation techniques for the clique partitioning problem. Discret. Appl. Math. 161(13-14): 2025-2037 (2013) - [j11]Dirk Briskorn
A note on "Multistage Methods for Freight Train Classification". Networks 62(1): 80-81 (2013) - [j10]Florian Jaehn:
Positioning of loading units in a transshipment yard storage area. OR Spectr. 35(2): 399-416 (2013) - [j9]Dirk Briskorn
Exact algorithms for inventory constrained scheduling on a single machine. J. Sched. 16(1): 105-115 (2013) - [j8]Nils Boysen
A Survey on Container Processing in Railway Yards. Transp. Sci. 47(3): 312-329 (2013) - 2012
- [j7]Ulrich Dorndorf, Florian Jaehn, Erwin Pesch:
Flight gate scheduling with respect to a reference schedule. Ann. Oper. Res. 194(1): 177-187 (2012) - [j6]Nils Boysen
Shunting yard operations: Theoretical aspects and applications. Eur. J. Oper. Res. 220(1): 1-14 (2012) - [j5]Nils Boysen
New bounds and algorithms for the transshipment yard scheduling problem. J. Sched. 15(4): 499-511 (2012) - 2011
- [j4]Nils Boysen
Scheduling Freight Trains in Rail-Rail Transshipment Yards. Transp. Sci. 45(2): 199-211 (2011) - 2010
- [j3]Florian Jaehn, Peter Letmathe
The emissions trading paradox. Eur. J. Oper. Res. 202(1): 248-254 (2010) - [j2]Daniel Scholz, Florian Jaehn, Andreas Junker:
Extensions to STaTS for practical applications of the facility layout problem. Eur. J. Oper. Res. 204(3): 463-472 (2010)
2000 – 2009
- 2008
- [j1]Ulrich Dorndorf, Florian Jaehn, Erwin Pesch:
Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem. Transp. Sci. 42(3): 292-301 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: