Heidemarie Bräsel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 10 from 10

2008

Heuristic constructive algorithms for open shop scheduling to minimize mean flow timeHeidemarie Bräsel, André Herms, Marc Mörig, Thomas Tautenhahn, Jan Tusch, Frank Werner. eor, 189(3):856-870, 2008. [doi]

2004

On the open-shop problem with preemption and minimizing the average completion timeHeidemarie Bräsel, Holger Hennes. eor, 157(3):607-619, 2004. [doi]

1999

On the hardness of the classical job shop problemHeidemarie Bräsel, Martin Harborth, Thomas Tautenhahn, Per Willenius. anor, 92:265-279, 1999. [doi]

On the set of solutions of the open shop problemHeidemarie Bräsel, Martin Harborth, Thomas Tautenhahn, Per Willenius. anor, 92:241-263, 1999. [doi]

1998

PrefaceHeidemarie Bräsel, Frank Werner 0001. anor, 83, 1998. [doi]

On the solution region for certainscheduling problems with preemptionHeidemarie Bräsel, Natalia V. Shakhlevich. anor, 83:1-22, 1998. [doi]

1996

New steps in the amazing world of sequences and schedulesHeidemarie Bräsel, Martina Kleinau. mmor, 43(2):195-214, 1996. [doi]

1995

A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree ConstraintsHeidemarie Bräsel, David Kluge, Frank Werner. DAM, 59(1):11-21, 1995. [doi]

1993

Constructive heuristic algorithms for the open shop problemHeidemarie Bräsel, Thomas Tautenhahn, Frank Werner. computing, 51(2):95-110, 1993. [doi]

1990

Lateinische Rechtecke und MaschinenbelegungHeidemarie Bräsel. PhD thesis, Technische Hochschule Magdeburg, Germany, 1990. [doi]

Sign in or sign up to see more results.

runs on WebDSL