Heiner Ackermann

According to our database, Heiner Ackermann authored at least 23 papers between 2007 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Online algorithms to schedule a proportionate flexible flow shop of batching machines.

Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke

J. Sched., 2022

2021

Robust flows with adaptive mitigation.

Heiner Ackermann, Erik Diessel, Sven O. Krumke

EURO J. Comput. Optim., 2021

Scheduling a Two Stage Proportionate Flexible Flow Shop with Dedicated Machines and No Buffers.

Heiner Ackermann, Lena Schwehm, Christian Weiß

Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

2020

Scheduling a proportionate flow shop of batching machines.

Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke

J. Sched., 2020

A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber.

Heiner Ackermann, Erik Diessel

EURO J. Comput. Optim., 2020

2019

Domino sequencing: Scheduling with state-based sequence-dependent setup times.

Erik Diessel, Heiner Ackermann

Oper. Res. Lett., 2019

Analyzing and Optimizing the Throughput of a Pharmaceutical Production Process.

Heiner Ackermann, Sandy Heydrich, Christian Weiß

Proceedings of the Operations Research Proceedings 2019, 2019

Decision Support for Material Procurement.

Heiner Ackermann, Erik Diessel, Michael Helmling, Christoph Hertrich, Neil Jami, Johanna Schneider

Proceedings of the Operations Research Proceedings 2019, 2019

2016

Time-hierarchical scheduling - A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem.

Jens Leoff, Heiner Ackermann, Karl-Heinz Küfer

J. Sched., 2016

Concurrent imitation dynamics in congestion games.

Heiner Ackermann, Petra Berenbrink, Simon Fischer, Martin Hoefer

Distributed Comput., 2016

2014

Modeling profit sharing in combinatorial exchanges by network flows.

Heiner Ackermann, Hendrik Ewe, Karl-Heinz Küfer, Michael Schröder

Ann. Oper. Res., 2014

2011

Distributed algorithms for QoS load balancing.

Heiner Ackermann, Simon Fischer, Martin Hoefer, Marcel Schöngens

Distributed Comput., 2011

Combinatorial Auctions in Freight Logistics.

Heiner Ackermann, Hendrik Ewe, Herbert Kopfer, Karl-Heinz Küfer

Proceedings of the Computational Logistics - Second International Conference, 2011

2010

Analysis of Algorithms.

Heiner Ackermann, Heiko Röglin, Ulf Schellbach, Nils Schweer

Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

2009

Pure Nash equilibria in player-specific and weighted congestion games.

Heiner Ackermann, Heiko Röglin, Berthold Vöcking

Theor. Comput. Sci., 2009

Uncoordinated two-sided matching markets.

Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking

SIGecom Exch., 2009

2008

On the impact of combinatorial structure on congestion games.

Heiner Ackermann, Heiko Röglin, Berthold Vöcking

J. ACM, 2008

Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games.

Heiner Ackermann, Alexander Skopalik

Internet Math., 2008

A Unified Approach to Congestion Games and Two-Sided Markets.

Heiner Ackermann, Paul W. Goldberg, Vahab S. Mirrokni, Heiko Röglin, Berthold Vöcking

Internet Math., 2008

Who Should Pay for Forwarding Packets?

Heiner Ackermann, Patrick Briest, Alexander Fanghänel, Berthold Vöcking

Internet Math., 2008

On the Convergence Time of the Best Response Dynamics in Player-specific Congestion Games

Heiner Ackermann, Heiko Röglin

CoRR, 2008

2007

Decision-making based on approximate and smoothed Pareto curves.

Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking

Theor. Comput. Sci., 2007

A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games.

Heiner Ackermann

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007