Dr. Arne Schulz

Foto: Arne Schulz
Wissenschaftlicher Mitarbeiter
Institut für Operations Management
Anschrift
Büro
Sprechzeiten
- nach Vereinbarung (Anmeldung per E-Mail)
Kontakt
Preise und Auszeichnungen
2022: |
Hamburger Lehrpreis |
2022: |
GOR Young Researchers Award |
2021: |
Professor Herbert Jacob-Preis |
2019: |
Young Professionals' Award Logistics |
Publikationsverzeichnis
Artikel in referierten Fachzeitschriften:
Schulz, A., Pfeiffer, C. (2023): Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems. European Journal of Operational Research.
DOI: https://doi.org/10.1016/j.ejor.2023.07.002
Schulz, A. (2023): The balanced maximally diverse grouping problem with integer attribute values. Journal of Combinatorial Optimization 45:135.
DOI: https://doi.org/10.1007/s10878-023-01061-2
Schulz, A., Suzuki, Y. (2023): An efficient heuristic for the fixed-route vehicle-refueling problem. Transportation Research Part E 169, 102963.
DOI: https://doi.org/10.1016/j.tre.2022.102963
Schulz, A., Fliedner, M. (2023): Minimizing the expected waiting time of emergency jobs. Journal of Scheduling 26, 147–167.
DOI: https://doi.org/10.1007/s10951-022-00767-1
Schulz, A. (2023): The balanced maximally diverse grouping problem with attribute values. Discrete Applied Mathematics 335, 82–103.
DOI: https://doi.org/10.1016/j.dam.2022.09.024
Schulz, A., Suzuki, Y. (2022): Bounds and valid inequalities for the fixed-route vehicle-refueling problem. Computers & Industrial Engineering 170, 108340.
DOI: https://doi.org/10.1016/j.cie.2022.108340
Schulz, A. (2022): A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values. Annals of Operations Research 318, 501–530.
DOI: https://doi.org/10.1007/s10479-022-04707-2
Nehrke, L., Schulz, A. (2022): Scheduling of waterways with tide and passing box. Naval Research Logistics 69(4), 609-621.
DOI: https://doi.org/10.1002/nav.22033
Pfeiffer, C., Schulz, A. (2022): An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization. OR Spectrum 44, 87-119.
DOI: https://doi.org/10.1007/s00291-021-00656-7
Schulz, A. (2021): The balanced maximally diverse grouping problem with block constraints. European Journal of Operational Research 294(1), 42-53.
DOI: https://doi.org/10.1016/j.ejor.2021.01.029
Schulz, A., Fliedner, M., Fiedrich, B., Pfeiffer, C. (2021): Levelling crane workload in multiyard rail-road container terminals. European Journal of Operational Research 293(3), 941-954.
DOI: https://doi.org/10.1016/j.ejor.2020.12.063
Artikel in referierten Konferenzbänden:
Schulz, A. (2022): The balanced maximally diverse grouping problem with attribute values and varying group sizes. In: Trautmann, N., Gnägi, M. (eds) Operations Research Proceedings 2021. OR 2021. Lecture Notes in Operations Research. Springer, Cham.
DOI: https://doi.org/10.1007/978-3-031-08623-6_23
Pfeiffer, C., Schulz, A. (2022): A new lower bound for the static dial-a-ride problem with ride and waiting time minimization. In: Freitag, M., Kinra, A., Kotzab, H., Megow, N. (eds): Dynamics in Logistics. Proceedings of the 8th International Conference LDIC 2022, Bremen, Germany, Lecture Notes in Logistics, Springer, 231–243.
DOI: https://doi.org/10.1007/978-3-031-05359-7_19
Forschungsdaten:
Schulz, A., Pfeiffer, C. (2022): Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems - instance data.
DOI: https://doi.org/10.25592/uhhfdm.10027
Schulz, A. (2022): The balanced maximally diverse grouping problem with attribute values - instance data.
DOI: https://doi.org/10.25592/uhhfdm.10231
Pfeiffer, C., Schulz, A. (2021): A new lower bound for the static dial-a-ride problem with ride and waiting time minimization - instance data.
DOI: http://doi.org/10.25592/uhhfdm.9669
Pfeiffer, C., Schulz, A. (2021): An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization - instance data.
DOI: http://doi.org/10.25592/uhhfdm.9610