Kellerer Hans

Hans Kellerer

Information about the author Hans Kellerer will soon be added to the site.
Found 28 papers in total
Dynamic Pricing to Minimize Maximum Regret
Dynamic Pricing to Minimize Maximum Regret
2017
We consider a dynamic pricing problem that involves selling a given inventory of a...
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
2016
This paper reviews the problems of Boolean non‐linear programming related to...
Parallel dedicated machines scheduling with chain precedence constraints
Parallel dedicated machines scheduling with chain precedence constraints
2012
A set of n nonpreemptive tasks are to be scheduled on m parallel dedicated machines...
Multiple subset sum with inclusive assignment set restrictions
Multiple subset sum with inclusive assignment set restrictions
2011
In a traditional multiple subset sum problem (MSSP), there is a given set of items and...
A 3/2‐approximation algorithm for ki‐partitioning
A 3/2‐approximation algorithm for ki‐partitioning
2011
We consider multiprocessor scheduling with the objective of minimizing the makespan....
Fast approximation algorithms to minimize a special weighted flow‐time criterion on a single machine with a non‐availability interval and release dates
Fast approximation algorithms to minimize a special weighted flow‐time criterion on a single machine with a non‐availability interval and release dates
2011
This paper is the first attempt to successfully design efficient approximation...
Scheduling parallel dedicated machines with the speeding-up resource
Scheduling parallel dedicated machines with the speeding-up resource
2008
We consider a problem of scheduling jobs on m parallel machines. The machines are...
An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
2008
We present a (3.5+ϵ)-approximation algorithm for a scheduling problem on...
Parallel machine scheduling with job assignment restrictions
Parallel machine scheduling with job assignment restrictions
2007
In the classical multiprocessor scheduling problem independent jobs must be assigned...
Improved dynamic programming in connection with a fully polynomial time approximation scheme for the knapsack problem
Improved dynamic programming in connection with a fully polynomial time approximation scheme for the knapsack problem
2004
A vector merging problem is introduced where two vectors of length n are merged such...
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
2003
The two-dimensional vector packing problem is the generalization of the classical...
Approximation schemes for ordered vector packing problems
Approximation schemes for ordered vector packing problems
2003
In this paper we deal with the d -dimensional vector packing problem, which is a...
Approximating multiobjective knapsack problems
Approximating multiobjective knapsack problems
2002
For multiobjective optimization problems, it is meaningful to compute a set of...
Bounds and tabu search for a cyclic max–min scheduling problem
Bounds and tabu search for a cyclic max–min scheduling problem
2001
A cyclic scheduling problem with applications to transport efficiency is considered....
Semi on-line algorithms for the partition problem
Semi on-line algorithms for the partition problem
1997
The partition problem is one of the basic NP-complete problems. While an efficient...
Algorithms for multiprocessor scheduling with machine release times
Algorithms for multiprocessor scheduling with machine release times
1998
In this paper we present algorithms for the problem of scheduling n independent jobs...
Cardinality constrained bin-packing problems
Cardinality constrained bin-packing problems
1999
We are concerned with a variant of the classical one-dimensional bin-packing problem....
Selecting portfolios with fixed costs and minimum transaction lots
Selecting portfolios with fixed costs and minimum transaction lots
2000
The original Markowitz model of portfolio selection has received a widespread...
Linear compound algorithms for the partitioning problem
Linear compound algorithms for the partitioning problem
2000
For a given set S of nonnegative integers the partitioning problem asks for a...
Approximation algorithms for knapsack problems with cardinality constraints
Approximation algorithms for knapsack problems with cardinality constraints
2000
We address a variant of the classical knapsack problem in which an upper bound is...
Two linear approximation algorithms for the subset-sum problem
Two linear approximation algorithms for the subset-sum problem
2000
In this paper we study the subset-sum problem, which is the problem of finding, given...
Bottleneck quadratic assignment problems and the bandwidth problem
Bottleneck quadratic assignment problems and the bandwidth problem
1998
We present new lower bounds on the bandwidth problem of undirected graphs. The results...
A 7/6-approximation algorithm for 3-partitioning and its application to multiprocessor scheduling
A 7/6-approximation algorithm for 3-partitioning and its application to multiprocessor scheduling
1999
The optimization version of the classical 3-partitioning problem is considered. 3 m...
The stock size problem
The stock size problem
1998
Consider a number of jobs that have to be completed within some fixed period of time....
Papers per page: