The following pages link to Heidemarie Bräsel (Q703915):
Displaying 14 items.
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- On the solution region for certain scheduling problems with preemption (Q1273129) (← links)
- (Q1310610) (redirect page) (← links)
- Constructive heuristic algorithms for the open shop problem (Q1310611) (← links)
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570) (← links)
- Stability of a schedule minimizing mean flow time (Q1362250) (← links)
- A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876) (← links)
- On the set of solutions of the open shop problem (Q1960322) (← links)
- On the hardness of the classical job shop problem (Q1960323) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- Heuristic constructive algorithms for open shop scheduling to minimize mean flow time (Q2482764) (← links)
- (Q2744381) (← links)
- (Q3139128) (← links)
- Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times (Q4888150) (← links)
