Heidemarie Bräsel

According to our database, Heidemarie Bräsel authored at least 11 papers between 1990 and 2008.

Collaborative distances:

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

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, Per Willenius

Math. Comput. Model., 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

2004

On the open-shop problem with preemption and minimizing the average completion time.

Heidemarie Bräsel, Holger Hennes

Eur. J. Oper. Res., 2004

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

1998

On the solution region for certainscheduling problems with preemption.

Heidemarie Bräsel, Natalia V. Shakhlevich

Ann. Oper. Res., 1998

Preface.

Heidemarie Bräsel, Frank Werner

Ann. Oper. Res., 1998

1996

New steps in the amazing world of sequences and schedules.

Heidemarie Bräsel, Martina Kleinau

Math. Methods Oper. Res., 1996

1995

A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints.

Heidemarie Bräsel, David Kluge, Frank Werner

Discret. Appl. Math., 1995

1993

Constructive heuristic algorithms for the open shop problem.

Heidemarie Bräsel, Thomas Tautenhahn, Frank Werner

Computing, 1993

1990

Lateinische Rechtecke und Maschinenbelegung.

Heidemarie Bräsel

PhD thesis, 1990