Fraunhofer-Institut für Techno- und Wirtschaftsmathematik ITWM
Fraunhofer-Institut für Techno- und Wirtschaftsmathematik ITWM

Profil Heiner Ackermann

Schwerpunkte/Kompetenzen

  • Analyse, mathematische Modellierung, Simulation und multi-kriterielle Optimierung von Produktionsplanungsproblemen
  • Entwicklung hierarchischer Entscheidungsprozesse inklusive deren Umsetzung in Software

 

Publikationen

Highlightpublikationen

  • Ackermann, H.; Küfer, K.-H.; Leithäuser, N.; Meyer, A.; Velten, S.:
    How to unload bulk carrier quickly? - Mathematical models to identify efficient loading patterns.
    The Journal of Scheduling, Special Issue MISTA 2015, 772-775, ISSN: 2305-249X, (2016)
  • Ackermann, H.; Leoff, J.; Küfer, K.-H.:
    Time-hierarchical scheduling - A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem.
    Journal of Scheduling, DOI: 10.1007/s10951-014-0384-y, (2014)
  • Ackermann, H.; Berenbrink, P.; Fischer, S.; Hoefer, M.:
    Concurrent imitation dynamics in congestion games.
    Distributed Computing, DOI: 10.1007/s00446-014-0223-6, (2014).

Fraunhofer-Publica

Sammlung der Publikationen von Heiner Ackermann in der Fraunhofer-Publica

YearTitle/AuthorDocument Type
2016Concurrent imitation dynamics in congestion games
Ackermann, H.; Berenbrink, P.; Fischer, S.; Hoefer, M.		Journal Article
2016Time-hierarchical scheduling: A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem
Leoff, J.; Ackermann, H.; Küfer, K.-H.		Journal Article
2015How to unload bulk carriers quickly?: Mathematical models to identify efficient loading patterns
Ackermann, Heiner; Küfer, Karl-Heinz; Leithäuser, Neele; Meyer, Andreas; Velten, Sebastian		Conference Paper
2014Modeling profit sharing in combinatorial exchanges by network flows
Ackermann, H.; Ewe, H.; Küfer, K.-H.; Schröder, M.		Journal Article
2013Time-hierarchical scheduling. A worst-case analysis of a rolling hierarchical approach for integrated production planning and scheduling in make-to-order environments
Leoff, J.; Ackermann, H.; Küfer, K.-H.		Conference Paper
2011Combinatorial auctions in freight logistics
Ackermann, H.; Ewe, H.; Kopfer, H.; Küfer, K.-H.		Conference Paper
2011Distributed algorithms for QoS load balancing
Ackermann, H.; Fischer, S.; Hoefer, M.; Schöngens, M.		Journal Article
2011Modeling profit sharing in combinatorial exchanges by network flows
Ackermann, H.; Ewe, H.; Küfer, K.-H.; Schröder, M.		Report
2011Uncoordinated two-sided matching markets
Ackermann, H.; Goldberg, P.W.; Mirrokni, V.S.; Röglin, H.; Vöcking, B.		Journal Article
2010Chapter 4: Analysis of algorithms
Ackermann, H.; Röglin, H.; Schellbach, U.; Schweer, N.		Book Article
2009Concurrent imitation dynamics in congestion games
Ackermann, H.; Berenbrink, P.; Fischer, S.; Hoefer, M.		Conference Paper
2009Distributed algorithms for QoS load balancing
Ackermann, H.; Fischer, S.; Hoefer, M.; Schöngens, M.		Conference Paper
2009Pure Nash equilibria in player-specific and weighted congestion games
Ackermann, H.; Röglin, H.; Vöcking, B.		Journal Article
2008Complexity of pure nash equilibria in player-specific network congestion games
Ackermann, H.; Skopalik, A.		Journal Article
2008A unified approach to congestion games and two-sided markets
Ackermann, H.; Goldberg, P.W.; Mirrokni, V.S.; Röglin, H.; Vöcking, B.		Journal Article
2008Who should pay for forwarding packets?
Ackermann, H.; Briest, P.; Fanghänel, A.; Vöcking, B.		Journal Article
This publication list has been generated from the publication database Fraunhofer-Publica.