Jansen Klaus

Klaus Jansen

Information about the author Klaus Jansen will soon be added to the site.
Found 15 papers in total
A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths
A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths
2011
In the cutting stock problem, we are given a set of objects of different types, and...
Approximation algorithms for scheduling with reservations
Approximation algorithms for scheduling with reservations
2010
We study the problem of non-preemptively scheduling n independent sequential jobs on a...
On packing rectangles with resource augmentation: maximizing the profit
On packing rectangles with resource augmentation: maximizing the profit
2008
We consider the problem of packing rectangles with profits into a bounded square...
Preemptive scheduling with dedicated processors: applications of fractional graph coloring
Preemptive scheduling with dedicated processors: applications of fractional graph coloring
2004
We study the problem of scheduling independent multiprocessor tasks, where for each...
Maximizing the total profit of rectangles packed into a rectangle
Maximizing the total profit of rectangles packed into a rectangle
2007
We consider the following rectangle packing problem. Given a set of rectangles, each...
Approximation schemes for job shop scheduling problems with controllable processing times
Approximation schemes for job shop scheduling problems with controllable processing times
2005
In this paper we study the job shop scheduling problem under the assumption that the...
Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme
Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme
2004
A malleable parallel task is one whose execution time is a function of the number of...
Approximation schemes for parallel machine scheduling problems with controllable processing times
Approximation schemes for parallel machine scheduling problems with controllable processing times
2004
We consider the problem of scheduling n independent jobs on m identical machines that...
Computing optimal preemptive schedules for parallel tasks: Linear programming approaches
Computing optimal preemptive schedules for parallel tasks: Linear programming approaches
2003
We study the problem of scheduling a set of n independent parallel tasks on m...
Improved approximation schemes for scheduling unrelated parallel machines
Improved approximation schemes for scheduling unrelated parallel machines
2001
We consider the problem of scheduling n independent jobs on m unrelated parallel...
An approximation algorithm for the license and shift class design problem
An approximation algorithm for the license and shift class design problem
1994
In this paper a generalization of the license and shift class design problem is...
UET-scheduling with chain-type precedence constraints
UET-scheduling with chain-type precedence constraints
1995
The authors consider a special case of the precedence constrained scheduling problem...
The allocation problem in hardware design
The allocation problem in hardware design
1993
In the synthesis of hardware structures different design steps are solved by...
Analysis of scheduling problems with typed task systems
Analysis of scheduling problems with typed task systems
1994
In this paper a scheduling problem has been analysed where each task has a type and...
Scheduling with constrained processor allocation for interval orders
Scheduling with constrained processor allocation for interval orders
1993
The paper considers a generalization of the precedence constrained scheduling problem...
Papers per page: