Articles with public access mandates - Dirk BriskornLearn more
Not available anywhere: 10
Container dispatching and conflict-free yard crane routing in an automated container terminal
J Nossack, D Briskorn, E Pesch
Transportation Science 52 (5), 1059-1076, 2018
Mandates: German Research Foundation
A decomposition heuristic for the twin robots scheduling problem
N Boysen, D Briskorn, S Emde
Naval Research Logistics (NRL) 62 (1), 16-22, 2015
Mandates: German Research Foundation
Scheduling shipments in closed-loop sortation conveyors
D Briskorn, S Emde, N Boysen
Journal of Scheduling 20, 25-42, 2017
Mandates: German Research Foundation
Optimizing carpool formation along high-occupancy vehicle lanes
N Boysen, D Briskorn, S Schwerdfeger, K Stephan
European Journal of Operational Research 293 (3), 1097-1112, 2021
Mandates: German Research Foundation
Interference aware scheduling of triple-crossover-cranes
D Briskorn, L Zey
Journal of Scheduling 23, 465-485, 2020
Mandates: German Research Foundation
A generator for test instances of scheduling problems concerning cranes in transshipment terminals
D Briskorn, F Jaehn, A Wiehl
Or Spectrum 41 (1), 45-69, 2019
Mandates: German Research Foundation
Synchronous flow shop problems: How much can we gain by leaving machines idle?
S Waldherr, S Knust, D Briskorn
Omega 72, 15-24, 2017
Mandates: German Research Foundation
Resolving interferences of triple‐crossover‐cranes by determining paths in networks
D Briskorn, L Zey
Naval Research Logistics (NRL) 65 (6-7), 477-498, 2018
Mandates: German Research Foundation
Vehicle sequencing at transshipment terminals with handover relations
D Briskorn, M Fliedner, M Tschöke
INFORMS Journal on Computing 33 (2), 477-494, 2021
Mandates: German Research Foundation
Modelling and optimising the capacity and production network planning in plastics processing factories
D Briskorn, L Rotfuß, M Helmdach
International Journal of Production Research 61 (7), 2105-2128, 2023
Mandates: German Research Foundation
Available somewhere: 14
Automated sortation conveyors: A survey from an operational research perspective
N Boysen, D Briskorn, S Fedtke, M Schmickerath
European Journal of Operational Research 276 (3), 796-815, 2019
Mandates: German Research Foundation
Cooperative twin-crane scheduling
D Briskorn, S Emde, N Boysen
Discrete Applied Mathematics 211, 40-57, 2016
Mandates: German Research Foundation
Scheduling co-operating stacking cranes with predetermined container sequences
D Briskorn, P Angeloudis
Discrete Applied Mathematics 201, 70-85, 2016
Mandates: German Research Foundation, UK Engineering and Physical Sciences Research …
Simultaneous planning for disaster road clearance and distribution of relief goods: a basic model and an exact solution method
D Briskorn, A Kimms, D Olschok
OR Spectrum 42 (3), 591-619, 2020
Mandates: German Research Foundation
Twin-crane scheduling during seaside workload peaks with a dedicated handshake area
L Zey, D Briskorn, N Boysen
Journal of Scheduling, 1-32, 2022
Mandates: German Research Foundation
No-wait scheduling for locks
W Passchyn, D Briskorn, FCR Spieksma
INFORMS Journal on Computing 31 (3), 413-428, 2019
Mandates: Belgian Science Policy Office
Bribery in k-Approval and k-Veto under partial information
D Briskorn, G Erdélyi, C Reger
Proceedings of the 2016 International Conference on Autonomous Agents …, 2016
Mandates: German Research Foundation
Packing chained items in aligned bins with applications to container transshipment and project scheduling
D Briskorn, M Fliedner
Mathematical Methods of Operations Research 75 (3), 305-326, 2012
Mandates: German Research Foundation
Parliament seating assignment problems
B Vangerven, D Briskorn, DR Goossens, FCR Spieksma
European Journal of Operational Research 296 (3), 914-926, 2022
Mandates: Netherlands Organisation for Scientific Research
Single-machine scheduling with an external resource
D Briskorn, M Davari, J Matuschke
European Journal of Operational Research 293 (2), 457-468, 2021
Mandates: German Research Foundation
Publication and funding information is determined automatically by a computer program