Sandy Heydrich

According to our database, Sandy Heydrich authored at least 12 papers between 2013 and 2024.

Collaborative distances:

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

2024

Scheduling a single machine with multiple due dates per job.

Raphael Kühn, Christian Weiß, Heiner Ackermann, Sandy Heydrich

J. Sched., December, 2024

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

2020

Scheduling a proportionate flow shop of batching machines.

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

J. Sched., 2020

2019

A Flexible Shift System for a Fully-Continuous Production Division.

Elisabeth Finhold, Tobias Fischer, Sandy Heydrich, Karl-Heinz Küfer

Proceedings of the Operations Research Proceedings 2019, 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

2018

A tale of two packing problems.

Sandy Heydrich

PhD thesis, 2018

2017

Faster approximation schemes for the two-dimensional knapsack problem.

Sandy Heydrich, Andreas Wiese

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Approximating Geometric Knapsack via L-Packings.

Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Improved Lower Bounds for Online Hypercube Packing.

Sandy Heydrich, Rob van Stee

CoRR, 2016

Beating the Harmonic Lower Bound for Online Bin Packing.

Sandy Heydrich, Rob van Stee

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014

Nearly Tight Approximability Results for Minimum Biclique Cover and Partition.

Parinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer

Proceedings of the Algorithms - ESA 2014, 2014

2013

Dividing Connected Chores Fairly.

Sandy Heydrich, Rob van Stee

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013