Thomas Tautenhahn

13 papers A* 1Journal 12
YearRankTypeTitle / Venue / Authors
2008 J jnl
Heuristic constructive algorithms for open shop scheduling to minimize mean flow time.
Eur. J. Oper. Res.
Heidemarie Bräsel, André Herms, Marc Mörig, Thomas Tautenhahn, Jan Tusch, Frank Werner
1999 J jnl
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.
SIAM J. Comput.
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
1999 J jnl
On the application of insertion techniques for job shop problems with setup times.
RAIRO Oper. Res.
Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner
1999 J jnl
On the hardness of the classical job shop problem.
Ann. Oper. Res.
Heidemarie Bräsel, Martin Harborth, Thomas Tautenhahn, Per Willenius
1999 J jnl
On the set of solutions of the open shop problem.
Ann. Oper. Res.
Heidemarie Bräsel, Martin Harborth, Thomas Tautenhahn, Per Willenius
1999 J jnl
Scheduling multi‐operation jobs on a single machine.
Ann. Oper. Res.
Alex E. Gerodimos, Celia A. Glass, Chris N. Potts, Thomas Tautenhahn
1997 J jnl
Minimizing the total completion time in a unit-time open shop with release times.
Oper. Res. Lett.
Thomas Tautenhahn, Gerhard J. Woeginger
1997 J jnl
Unit-Time Scheduling Problems with Time Dependent Resources.
Computing
Thomas Tautenhahn, Gerhard J. Woeginger
1996 A* conf
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.
STOC
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
1996 J jnl
On unit time open shops with additional restrictions.
Math. Methods Oper. Res.
Thomas Tautenhahn
1994 J jnl
Scheduling Unit-Time Open Shops with Deadlines.
Oper. Res.
Thomas Tautenhahn
1993 J jnl
Constructive heuristic algorithms for the open shop problem.
Computing
Heidemarie Bräsel, Thomas Tautenhahn, Frank Werner
1993 J jnl
Scheduling unit time open shops to minimize the weighted number of late jobs.
Oper. Res. Lett.
Peter Brucker, Bernd Jurisch, Thomas Tautenhahn, Frank Werner