• Dissertation, 1995

     A. Krämer

    Scheduling Multiprocessortasks on Dedicated Processors

  • Osnabrücker Schriften zur Mathematik, Reihe P, No. 170, 1995

     P. Brucker, J.Hurink, B. Jurisch, B. Wöstmann

    A Branch & Bound Algorithm for the Open-Shop Problem

  • Osnabrücker Schriften zur Mathematik, Reihe P, No. 160, 1994

     P. Brucker, M.Y. Kovalyov

    Single machine batch scheduling to minimize the weighted number of late jobs

  • Osnabrücker Schriften zur Mathematik, Reihe P, No. 166, 1994

    P. Brucker, B. Jurisch, A. Krämer

    Complexity of scheduling problems with multi-purpose machines

  • Osnabrücker Schriften zur Mathematik, Reihe P, No. 162, 1994

    P. Brucker, J. Hurink, F. Werner

    Improving local search heuristics for some scheduling problems (Part II)

    to appear in Discrete Applied Mathematics

  • Osnabrücker Schriften zur Mathematik, Reihe P, No. 161, 1994

    P. Brucker, M.Y. Kovalyov, F. Werner

    Parallel machine batch scheduling with deadlines and sequence independent set-ups

  • Osnabrücker Schriften zur Mathematik, Reihe P, No. 165, 1994

    P. Brucker, A. Krämer

    Polynomial algorithms for resource constrained and multiprocessor task scheduling problems with a fixed number of task types

  • Osnabrücker Schriften zur Mathematik, Reihe P, No. 164, 1994

    P. Brucker, T. Hilbig, J. Hurink

    Scheduling problems with start-start relations between jobs

  • Dissertation, 1992

    W. Meyer

    Geometrische Methoden zur Lösung von Job-Shop Problemen und deren Verallgemeinerungen

  • Dissertation, 1992

    B. Jurisch

    Scheduling Jobs in Shops with Multi-Purpose Machines

  • Osnabrücker Schriften zur Mathematik, Reihe P, No. 168, 1994

    P. Brucker, O. Thiele

    A Branch & Bound Method for the General Sequence Dependent Setup-Times