Tautenhahn Thomas

Thomas Tautenhahn

Information about the author Thomas Tautenhahn will soon be added to the site.
Found 8 papers in total
On the application of insertion techniques for job shop problems with setup times
On the application of insertion techniques for job shop problems with setup times
1999
Constructive heuristics for shop scheduling problems are often based on priority (or...
Scheduling multi-operation jobs on a single machine
Scheduling multi-operation jobs on a single machine
1999
We consider the problem of scheduling n multi-operation jobs on a single machine. Each...
On the set of solutions of the open shop problem
On the set of solutions of the open shop problem
1999
In the classical open shop problem, n jobs have to be processed on m machines, where...
On the hardness of the classical job shop problem
On the hardness of the classical job shop problem
1999
In a classical job shop problem, n jobs have to be processed on m machines, where the...
Scheduling a batching machine
Scheduling a batching machine
1998
We address the problem of scheduling n jobs on a batching machine to minimize regular...
Minimizing the total completion time in a unit-time open shop with release times
Minimizing the total completion time in a unit-time open shop with release times
1997
We consider the problem of minimizing the total completion time in a unit-time open...
Open-shop scheduling with release dates to minimize maximum lateness
Open-shop scheduling with release dates to minimize maximum lateness
1995
The authors present the first polynomial-time algorithm for an open-shop problem with...
Scheduling unit time open shops to minimize the weighted number of late jobs
Scheduling unit time open shops to minimize the weighted number of late jobs
1993
The authors present a polynomial algorithm for the problem of scheduling an open shop...
Papers per page: