H. Röck

Minimizing mean flow-time with parallel processors and resource constraints

Wieslaw Kubiak, Jayme Luiz Szwarcfiter, Jacek Blazewicz, 1987, Acta Informatica.

Scheduling tasks on two processors with deadlines and additional resources

Wieslaw Kubiak, Jacek Blazewicz, J. Barcelo, 1986 .

Bus Routing Problems on Acyclic Networks

Hans Röck, H. Röck, 1981, WG.

A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems

Satoru Fujishige, Hans Röck, Uwe Zimmermann, 1989, Math. Oper. Res..

Some new results in flow shop scheduling

Hans Röck, H. Röck, 1984, Z. Oper. Research.

The Three-Machine No-Wait Flow Shop is NP-Complete

Hans Röck, H. Röck, 1984, JACM.