8 citations · 23 across the 4 of their papers we have counts for
5 papers
Scheduling a Proportionate Flow Shop of Batching Machines
Christoph Hertrich, Christian Weiß, Heiner Ackermann +2
In this paper we study a proportionate flow shop of batching machines with release dates and a fixed number of machines. The scheduling problem has so far barely receive…
Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines
Christoph Hertrich, Christian Weiß, Heiner Ackermann +2
This paper is the first to consider online algorithms to schedule a proportionate flexible flow shop of batching machines (PFFB). The scheduling model is motivated by manufacturing…
Approximating Geometric Knapsack via L-packings
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich +3
We study the two-dimensional geometric knapsack problem (2DK) in which we are given a set of n axis-aligned rectangular items, each one with an associated profit, and an axis-align…
Improved Lower Bounds for Online Hypercube and Rectangle Packing
David Blitz, Sandy Heydrich, Rob van Stee +2
Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing boxes into bins in two or more…
Beating the Harmonic lower bound for online bin packing
Sandy Heydrich, Rob van Stee
In the online bin packing problem, items of sizes in (0,1] arrive online to be packed into bins of size 1. The goal is to minimize the number of used bins. In this paper, we presen…