Sandy Heydrich

19 papers A* 3A 1B 1Journal 11Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
Scheduling a single machine with multiple due dates per job.
J. Sched.
Raphael Kühn, Christian Weiß, Heiner Ackermann, Sandy Heydrich
2022 J jnl
Online algorithms to schedule a proportionate flexible flow shop of batching machines.
J. Sched.
Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke
2021 J jnl
Approximating Geometric Knapsack via L-packings.
ACM Trans. Algorithms
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese
2020 J jnl
Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines.
CoRR
Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke
2020 J jnl
Scheduling a Proportionate Flow Shop of Batching Machines.
CoRR
Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke
2020 J jnl
Scheduling a proportionate flow shop of batching machines.
J. Sched.
Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke
2019 — conf
A Flexible Shift System for a Fully-Continuous Production Division.
OR
Elisabeth Finhold, Tobias Fischer, Sandy Heydrich, Karl-Heinz Küfer
2019 — conf
Analyzing and Optimizing the Throughput of a Pharmaceutical Production Process.
OR
Heiner Ackermann, Sandy Heydrich, Christian Weiß
2019 J jnl
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem.
ACM Trans. Algorithms
Sandy Heydrich, Andreas Wiese
2018 — —
A tale of two packing problems.
Sandy Heydrich
2017 A* conf
Approximating Geometric Knapsack via L-Packings.
FOCS
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
2017 J jnl
Approximating Geometric Knapsack via L-packings.
CoRR
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
2017 A* conf
Faster approximation schemes for the two-dimensional knapsack problem.
SODA
Sandy Heydrich, Andreas Wiese
2016 A* conf
Beating the Harmonic Lower Bound for Online Bin Packing.
ICALP
Sandy Heydrich, Rob van Stee
2016 J jnl
Improved Lower Bounds for Online Hypercube Packing.
CoRR
Sandy Heydrich, Rob van Stee
2015 J jnl
Beating the Harmonic lower bound for online bin packing.
CoRR
Sandy Heydrich, Rob van Stee
2015 J jnl
Dividing connected chores fairly.
Theor. Comput. Sci.
Sandy Heydrich, Rob van Stee
2014 A conf
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition.
ESA
Parinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer
2013 B conf
Dividing Connected Chores Fairly.
SAGT
Sandy Heydrich, Rob van Stee