Bus Routing Problems on Acyclic Networks. - Hans Röck (WG, 1981)

Flowshop Scheduling with no Wait in Process on Three Machines. - Hans Röck (WG, 1982)

The Three-Machine No-Wait Flow Shop is NP-Complete. - Hans Röck (J. ACM, 1984)

Netzflußmodelle zur präferenzorientierten dynamischen Einsatz und Ablaufplanung. - Gilbert Kalb; Hans Röck; Günter Schmidt 002 (Z. Oper. Research, 1984)

Some new results in flow shop scheduling. - Hans Röck (Z. Oper. Research, 1984)

Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. - Jacek Blazewicz; Wieslaw Kubiak; Hans Röck; Jayme Luiz Szwarcfiter (Acta Informatica, 1987)

A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems. - Satoru Fujishige; Hans Röck; Uwe Zimmermann (Math. Oper. Res., 1989)

Resource Constrained Chain Scheduling of UET Jobs on Two Machines. - Wieslaw Kubiak; Jacek Blazewicz; Moshe Dror; N. Katoh; Hans Röck (Oper. Res., 1998)