default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDirk Briskorn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j77]Michael Dienstknecht
, Dirk Briskorn:
Sharing in construction projects - On determining optimal container assignments for the on-site accommodation of trades. Eur. J. Oper. Res. 315(1): 324-337 (2024)- [j76]Dirk Briskorn, Jochen Gönsch, Antonia Thiemeyer:
Scheduling maintenance activities subject to stochastic job-dependent machine deterioration. Eur. J. Oper. Res. 319(1): 62-78 (2024) - [j75]Arne Schulz, Nils Boysen, Dirk Briskorn:
Centrally-chosen versus user-selected swaps: How the selection of swapping stations impacts standby battery inventories. Eur. J. Oper. Res. 319(3): 726-738 (2024) - [j74]Alexander Wyrowski, Nils Boysen, Dirk Briskorn, Stefan Schwerdfeger:
Public transport crowdshipping: moving shipments among parcel lockers located at public transport stations. OR Spectr. 46(3): 873-907 (2024) - [j73]Nils Boysen, Dirk Briskorn, Rea Röntgen, Michael Dienstknecht:
Matching vs. Individual Choice: How to Counter Regional Imbalance of Carsharing Demand. Transp. Sci. 58(1): 198-218 (2024) - 2023
- [j72]Nils Boysen, Dirk Briskorn, Johannes Rupp:
Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person. Comput. Oper. Res. 151: 106123 (2023) - [j71]Dirk Briskorn, Lena Rotfuß, Marcel Helmdach:
Modelling and optimising the capacity and production network planning in plastics processing factories. Int. J. Prod. Res. 61(7): 2105-2128 (2023) - [j70]Dirk Briskorn, Gerhard J. Woeginger:
Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations. Oper. Res. Lett. 51(3): 285-288 (2023) - [j69]Nils Boysen, Dirk Briskorn, Stefan Schwerdfeger:
How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring. J. Sched. 26(1): 19-41 (2023) - 2022
- [j68]Bart Vangerven, Dirk Briskorn, Dries R. Goossens, Frits C. R. Spieksma:
Parliament seating assignment problems. Eur. J. Oper. Res. 296(3): 914-926 (2022) - [j67]Sönke Hartmann, Dirk Briskorn:
An updated survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 297(1): 1-14 (2022) - [j66]Johannes Rupp, Nils Boysen, Dirk Briskorn:
Optimizing consolidation processes in hubs: The hub-arrival-departure problem. Eur. J. Oper. Res. 298(3): 1051-1066 (2022) - [j65]Stefan Schwerdfeger, Stefan Bock, Nils Boysen, Dirk Briskorn:
Optimizing the electrification of roads with charge-while-drive technology. Eur. J. Oper. Res. 299(3): 1111-1127 (2022) - [j64]Dirk Briskorn, Stefan Waldherr:
Anarchy in the UJ: Coordination mechanisms for minimizing the number of late jobs. Eur. J. Oper. Res. 301(3): 815-827 (2022) - [j63]Michael Dienstknecht, Nils Boysen, Dirk Briskorn:
The traveling salesman problem with drone resupply. OR Spectr. 44(4): 1045-1086 (2022) - [j62]Lennart Zey, Dirk Briskorn, Nils Boysen:
Twin-crane scheduling during seaside workload peaks with a dedicated handshake area. J. Sched. 25(1): 3-34 (2022) - [j61]Dirk Briskorn, Konrad Stephan, Nils Boysen:
Minimizing the makespan on a single machine subject to modular setups. J. Sched. 25(1): 125-137 (2022) - 2021
- [j60]Dirk Briskorn, Thomas Wensing:
The replenishment problem with multiple articles and an order threshold. Comput. Oper. Res. 136: 105485 (2021) - [j59]Dirk Briskorn, Morteza Davari, Jannik Matuschke:
Single-machine scheduling with an external resource. Eur. J. Oper. Res. 293(2): 457-468 (2021) - [j58]Nils Boysen, Dirk Briskorn, Stefan Schwerdfeger, Konrad Stephan:
Optimizing carpool formation along high-occupancy vehicle lanes. Eur. J. Oper. Res. 293(3): 1097-1112 (2021) - [j57]Dirk Briskorn, Malte Fliedner, Martin Tschöke:
Vehicle Sequencing at Transshipment Terminals with Handover Relations. INFORMS J. Comput. 33(2): 477-494 (2021) - [j56]Dirk Briskorn:
Routing two stacking cranes with predetermined container sequences. J. Sched. 24(4): 367-380 (2021) - [j55]Nils Boysen, Dirk Briskorn, Stefan Schwerdfeger:
Walk the Line: Optimizing the Layout Design of Moving Walkways. Transp. Sci. 55(4): 908-929 (2021) - 2020
- [j54]Dirk Briskorn, Alf Kimms, Denis Olschok:
Simultaneous planning for disaster road clearance and distribution of relief goods: a basic model and an exact solution method. OR Spectr. 42(3): 591-619 (2020) - [j53]Dirk Briskorn, Lennart Zey:
Interference aware scheduling of triple-crossover-cranes. J. Sched. 23(4): 465-485 (2020) - [i1]Dirk Briskorn, Morteza Davari, Jannik Matuschke:
Single-machine scheduling with an external resource. CoRR abs/2006.03399 (2020)
2010 – 2019
- 2019
- [j52]Dirk Briskorn, Michael Dienstknecht:
Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference. Eur. J. Oper. Res. 273(1): 160-174 (2019) - [j51]Nils Boysen, Dirk Briskorn, Stefan Fedtke, Marcel Schmickerath:
Automated sortation conveyors: A survey from an operational research perspective. Eur. J. Oper. Res. 276(3): 796-815 (2019) - [j50]Nils Boysen, Dirk Briskorn, Stefan Schwerdfeger:
Matching supply and demand in a sharing economy: Classification, computational complexity, and application. Eur. J. Oper. Res. 278(2): 578-595 (2019) - [j49]Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma:
No-Wait Scheduling for Locks. INFORMS J. Comput. 31(3): 413-428 (2019) - [j48]Dirk Briskorn:
On approximating maximum covering cycles in undirected graphs. Optim. Lett. 13(2): 445-448 (2019) - [j47]Dirk Briskorn, Florian Jaehn, Andreas Wiehl:
A generator for test instances of scheduling problems concerning cranes in transshipment terminals. OR Spectr. 41(1): 45-69 (2019) - [j46]Dirk Briskorn, Philipp Zeise:
A cyclic production scheme for the synchronized and integrated two-level lot-sizing and scheduling problem with no-wait restrictions and stochastic demand. OR Spectr. 41(4): 895-942 (2019) - 2018
- [j45]Dirk Briskorn, Michael Dienstknecht:
Survey of quantitative methods in construction. Comput. Oper. Res. 92: 194-207 (2018) - [j44]Nils Boysen, Dirk Briskorn, Stefan Fedtke, Stefan Schwerdfeger:
Drone delivery from trucks: Drone scheduling for given truck routes. Networks 72(4): 506-527 (2018) - [j43]Stefan Schwerdfeger, Nils Boysen, Dirk Briskorn:
Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal. OR Spectr. 40(1): 1-21 (2018) - [j42]Nils Boysen, Dirk Briskorn, Sigrid Knust:
Rail terminal operations. OR Spectr. 40(2): 317-318 (2018) - [j41]Nils Boysen, Dirk Briskorn, Simon Emde:
Scheduling electric vehicles and locating charging stations on a path. J. Sched. 21(1): 111-126 (2018) - [j40]Jenny Nossack, Dirk Briskorn, Erwin Pesch:
Container Dispatching and Conflict-Free Yard Crane Routing in an Automated Container Terminal. Transp. Sci. 52(5): 1059-1076 (2018) - [j39]Felix Weidinger, Nils Boysen, Dirk Briskorn:
Storage Assignment with Rack-Moving Mobile Robots in KIVA Warehouses. Transp. Sci. 52(6): 1479-1495 (2018) - 2017
- [j38]Nils Boysen, Dirk Briskorn, Frank Meisel:
A generalized classification scheme for crane scheduling with interference. Eur. J. Oper. Res. 258(1): 343-357 (2017) - [j37]Nils Boysen, Dirk Briskorn, Simon Emde:
Sequencing of picking orders in mobile rack warehouses. Eur. J. Oper. Res. 259(1): 293-307 (2017) - [j36]Nils Boysen, Dirk Briskorn, Simon Emde:
Parts-to-picker based order processing in a rack-moving mobile robots environment. Eur. J. Oper. Res. 262(2): 550-562 (2017) - [j35]Dirk Briskorn, Simon Emde, Nils Boysen:
Scheduling shipments in closed-loop sortation conveyors. J. Sched. 20(1): 25-42 (2017) - [j34]Liliana Grigoriu, Dirk Briskorn:
Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations. J. Sched. 20(2): 183-197 (2017) - 2016
- [j33]Dirk Briskorn, Kurt Jørnsten, Philipp Zeise:
A pricing scheme for combinatorial auctions based on bundle sizes. Comput. Oper. Res. 70: 9-17 (2016) - [j32]Dirk Briskorn, Panagiotis Angeloudis:
Scheduling co-operating stacking cranes with predetermined container sequences. Discret. Appl. Math. 201: 70-85 (2016) - [j31]Malte Fliedner, Dirk Briskorn, Nils Boysen:
Vehicle scheduling under the warehouse-on-wheels policy. Discret. Appl. Math. 205: 52-61 (2016) - [j30]Dirk Briskorn, Simon Emde, Nils Boysen:
Cooperative twin-crane scheduling. Discret. Appl. Math. 211: 40-57 (2016) - [j29]Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma:
Mathematical programming models for lock scheduling with an emission objective. Eur. J. Oper. Res. 248(3): 802-814 (2016) - [j28]Ward Passchyn, Sofie Coene, Dirk Briskorn, Johann L. Hurink, Frits C. R. Spieksma, Greet Vanden Berghe:
The lockmaster's problem. Eur. J. Oper. Res. 251(2): 432-441 (2016) - [j27]Murat Firat, Dirk Briskorn, Alexandre Laugier:
A Branch-and-Price algorithm for stable workforce assignments with hierarchical skills. Eur. J. Oper. Res. 251(2): 676-685 (2016) - [j26]Dirk Briskorn, Philipp Zeise, Josef Packowski:
Quasi-fixed cyclic production schemes for multiple products with stochastic demand. Eur. J. Oper. Res. 252(1): 156-169 (2016) - [j25]Dirk Briskorn, Kurt Jørnsten, Jenny Nossack:
Pricing combinatorial auctions by a set of linear price vectors. OR Spectr. 38(4): 1043-1070 (2016) - [c5]Dirk Briskorn, Gábor Erdélyi, Christian Reger:
Bribery in k-Approval and k-Veto Under Partial Information: (Extended Abstract). AAMAS 2016: 1299-1300 - 2015
- [j24]Alexander Lieder, Dirk Briskorn, Raik Stolletz:
A dynamic programming approach for the aircraft landing problem with aircraft classes. Eur. J. Oper. Res. 243(1): 61-69 (2015) - 2014
- [j23]Dirk Briskorn, Raik Stolletz:
Aircraft landing problems with aircraft classes. J. Sched. 17(1): 31-45 (2014) - [j22]Simon Emde, Nils Boysen, Dirk Briskorn:
The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions. J. Sched. 17(3): 289-303 (2014) - [c4]Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma:
Mathematical programming models for scheduling locks in sequence. ATMOS 2014: 92-106 - 2013
- [j21]Dirk Briskorn, Joseph Y.-T. Leung:
Minimizing maximum lateness of jobs in inventory constrained scheduling. J. Oper. Res. Soc. 64(12): 1851-1864 (2013) - [j20]Dirk Briskorn, Florian Jaehn:
A note on "Multistage Methods for Freight Train Classification". Networks 62(1): 80-81 (2013) - [j19]Nils Boysen, Dirk Briskorn, Martin Tschöke:
Truck scheduling in cross-docking terminals with fixed outbound departures. OR Spectr. 35(2): 479-504 (2013) - [j18]Dirk Briskorn, Florian Jaehn, Erwin Pesch:
Exact algorithms for inventory constrained scheduling on a single machine. J. Sched. 16(1): 105-115 (2013) - 2012
- [j17]Dirk Briskorn, Andrei Horbach:
A Lagrangian approach for minimum cost single round robin tournaments. Comput. Oper. Res. 39(3): 718-727 (2012) - [j16]Marcel Büther, Dirk Briskorn:
Reducing the 0-1 Knapsack Problem with a Single Continuous Variable to the Standard 0-1 Knapsack Problem. Int. J. Oper. Res. Inf. Syst. 3(1): 1-12 (2012) - [j15]Dirk Briskorn, Malte Fliedner:
Packing chained items in aligned bins with applications to container transshipment and project scheduling. Math. Methods Oper. Res. 75(3): 305-326 (2012) - [j14]Andrei Horbach, Thomas Bartsch, Dirk Briskorn:
Using a SAT-solver to schedule sports leagues. J. Sched. 15(1): 117-125 (2012) - [j13]Stefan Bock, Dirk Briskorn, Andrei Horbach:
Scheduling flexible maintenance activities subject to job-dependent machine deterioration. J. Sched. 15(5): 565-578 (2012) - 2011
- [j12]Dirk Briskorn:
A branching scheme for minimum cost tournaments with regard to real-world constraints. J. Oper. Res. Soc. 62(12): 2133-2145 (2011) - 2010
- [j11]Dirk Briskorn, Andreas Drexl, Frits C. R. Spieksma:
Round robin tournaments and three index assignments. 4OR 8(4): 365-374 (2010) - [j10]Dirk Briskorn, Sigrid Knust:
Constructing fair sports league schedules with regard to strength groups. Discret. Appl. Math. 158(2): 123-135 (2010) - [j9]Sönke Hartmann, Dirk Briskorn:
A survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 207(1): 1-14 (2010) - [j8]Dirk Briskorn, Byung-Cheon Choi, Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Complexity of single machine scheduling subject to nonnegative inventory constraints. Eur. J. Oper. Res. 207(2): 605-619 (2010) - [j7]Pim van 't Hof, Gerhard F. Post, Dirk Briskorn:
Constructing fair round robin tournaments with a minimum number of breaks. Oper. Res. Lett. 38(6): 592-596 (2010)
2000 – 2009
- 2009
- [j6]Dirk Briskorn, Andreas Drexl:
IP models for round robin tournaments. Comput. Oper. Res. 36(3): 837-852 (2009) - [j5]Dirk Briskorn:
Combinatorial properties of strength groups in round robin tournaments. Eur. J. Oper. Res. 192(3): 744-754 (2009) - [j4]Dirk Briskorn, Andreas Drexl:
A branching scheme for finding cost-minimal round robin tournaments. Eur. J. Oper. Res. 197(1): 68-76 (2009) - [j3]Dirk Briskorn, Andreas Drexl:
A branch-and-price algorithm for scheduling sport leagues. J. Oper. Res. Soc. 60(1): 84-93 (2009) - 2008
- [j2]Dirk Briskorn:
Feasibility of home-away-pattern sets for round robin tournaments. Oper. Res. Lett. 36(3): 283-284 (2008) - 2007
- [c3]Dirk Briskorn:
Alternative IP Models for Sport Leagues Scheduling. OR 2007: 403-408 - 2006
- [j1]Dirk Briskorn, Andreas Drexl, Sönke Hartmann:
Inventory-based dispatching of automated guided vehicles on container terminals. OR Spectr. 28(4): 611-630 (2006) - [c2]Dirk Briskorn, Andreas Drexl:
Branching Based on Home-Away-Pattern Sets. OR 2006: 523-528 - 2005
- [c1]Dirk Briskorn, Sönke Hartmann:
Simulating Dispatching Strategies for Automated Container Terminals. OR 2005: 97-102
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-10-07 22:06 CEST 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:
