The following pages link to Michael Andresen (Q1761790):
Displaying 3 items.
- New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan (Q1761791) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- On transitive orientations of G-e (Q3560775) (← links)
