19 citations · 61 across the 20 of their papers we have counts for
8 papers · 1 filter
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…
An FPTAS for the Knapsack Problem with Parametric Weights
Michael Holzhauser, Sven O. Krumke
In this paper, we investigate the parametric weight knapsack problem, in which the item weights are affine functions of the form for $i \in \{1,\ldots,n…
An FPTAS for the parametric knapsack problem
Michael Holzhauser, Sven O. Krumke
In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued parameter. The aim is to provide a solution…
A Generalized Approximation Framework for Fractional Network Flow and Packing Problems
Michael Holzhauser, Sven O. Krumke
We generalize the fractional packing framework of Garg and Koenemann to the case of linear fractional packing problems over polyhedral cones. More precisely, we provide approximati…
On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
We investigate the complexity and approximability of the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a secon…
A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
We present a specialized network simplex algorithm for the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a sec…
ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem
Sahar Bsaybes, Sven O. Krumke, Alain Quilliot +2
In a carsharing system, a fleet of cars is distributed at stations in an urban area, customers can take and return cars at any time and station. For operating such a system in a sa…