Lateinische Rechtecke und Maschinenbelegung. - Heidemarie Bräsel (1990)

Constructive heuristic algorithms for the open shop problem. - Heidemarie Bräsel; Thomas Tautenhahn; Frank Werner 001 (Computing, 1993)

A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints. - Heidemarie Bräsel; David Kluge; Frank Werner 001 (Discret. Appl. Math., 1995)

New steps in the amazing world of sequences and schedules. - Heidemarie Bräsel; Martina Kleinau (Math. Methods Oper. Res., 1996)

Preface. - Heidemarie Bräsel; Frank Werner 001 (Ann. Oper. Res., 1998)

On the solution region for certainscheduling problems with preemption. - Heidemarie Bräsel; Natalia V. Shakhlevich (Ann. Oper. Res., 1998)

On the set of solutions of the open shop problem. - Heidemarie Bräsel; Martin Harborth; Thomas Tautenhahn; Per Willenius (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 open-shop problem with preemption and minimizing the average completion time. - Heidemarie Bräsel; Holger Hennes (Eur. J. Oper. Res., 2004)

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 001 (Eur. J. Oper. Res., 2008)

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop. - Michael Andresen; Heidemarie Bräsel; Marc Mörig; Jan Tusch; Frank Werner 001; Per Willenius (Math. Comput. Model., 2008)