Thomas Tautenhahn

According to our database, Thomas Tautenhahn authored at least 12 papers between 1993 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

Heuristic constructive algorithms for open shop scheduling to minimize mean flow time.

Heidemarie Bräsel, André Herms, Marc Mörig, Thomas Tautenhahn, Jan Tusch, Frank Werner

Eur. J. Oper. Res., 2008

1999

On the application of insertion techniques for job shop problems with setup times.

Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner

RAIRO Oper. Res., 1999

Scheduling multi‐operation jobs on a single machine.

Alex E. Gerodimos, Celia A. Glass, Chris N. Potts, Thomas Tautenhahn

Ann. Oper. Res., 1999

On the hardness of the classical job shop problem.

Heidemarie Bräsel, Martin Harborth, Thomas Tautenhahn, Per Willenius

Ann. Oper. Res., 1999

On the set of solutions of the open shop problem.

Heidemarie Bräsel, Martin Harborth, Thomas Tautenhahn, Per Willenius

Ann. Oper. Res., 1999

1997

Minimizing the total completion time in a unit-time open shop with release times.

Thomas Tautenhahn, Gerhard J. Woeginger

Oper. Res. Lett., 1997

Unit-Time Scheduling Problems with Time Dependent Resources.

Thomas Tautenhahn, Gerhard J. Woeginger

Computing, 1997

1996

On unit time open shops with additional restrictions.

Thomas Tautenhahn

Math. Methods Oper. Res., 1996

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.

Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1994

Scheduling Unit-Time Open Shops with Deadlines.

Thomas Tautenhahn

Oper. Res., 1994

1993

Scheduling unit time open shops to minimize the weighted number of late jobs.

Peter Brucker, Bernd Jurisch, Thomas Tautenhahn, Frank Werner

Oper. Res. Lett., 1993

Constructive heuristic algorithms for the open shop problem.

Heidemarie Bräsel, Thomas Tautenhahn, Frank Werner

Computing, 1993