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)

On transitive orientations of G-e. - Michael Andresen (Discuss. Math. Graph Theory, 2009)

Zur Komplexität von Reduzierbarkeitsproblemen über H-Comparabilitygraphen. - Michael Andresen (2009)

New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan. - Michael Andresen; Tanka Nath Dhamala (Ann. Oper. Res., 2012)