Sandy Heydrich

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Scheduling a single machine with multiple due dates per job Journal of Scheduling	2025-01-07	Paper
Online algorithms to schedule a proportionate flexible flow shop of batching machines Journal of Scheduling	2022-11-04	Paper
Approximating Geometric Knapsack via L-packings ACM Transactions on Algorithms	2022-02-22	Paper
A flexible shift system for a fully-continuous production division	2021-08-30	Paper
Analyzing and optimizing the throughput of a pharmaceutical production process	2021-08-30	Paper
Scheduling a proportionate flow shop of batching machines Journal of Scheduling	2020-12-11	Paper
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem ACM Transactions on Algorithms	2019-12-02	Paper
Faster approximation schemes for the two-dimensional knapsack problem Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
Beating the harmonic lower bound for online bin packing (available as arXiv preprint)	2017-12-19	Paper
Dividing connected chores fairly Theoretical Computer Science	2015-10-08	Paper
Nearly tight approximability results for minimum biclique cover and partition Algorithms - ESA 2014	2014-10-08	Paper
Dividing connected chores fairly Algorithmic Game Theory	2013-10-23	Paper

Research outcomes over time

This page was built for person: Sandy Heydrich