Scheduling problems are concerned with the allocation of scarce
resources to activities over time. These problems have a lot of
applications in production planning, project scheduling, traffic
scheduling (airplanes, railway) or timetabling.
New and more complex models were considered which combine classical models
with additional restrictions arising from practical problems. Besides
theoretical aspects a main issue was the development and efficient
implementation of exact or heuristic algorithms and the calculation of
lower bounds.
Publications:
General topics
P. Brucker, S. Knust [2006]:
Complex Scheduling, Springer.
P. Brucker, S. Knust [2012]:
Complex Scheduling, 2nd edition, Springer.
Exact algorithms
P. Brucker, S. Knust [1998]:
Solving large-sized resource-constrained project scheduling problems,
in: J.Weglarz (ed.): Project Scheduling: Recent Models, Algorithms and
Applications, Kluwer, 27-51.
P. Brucker, S. Knust, A. Schoo, O. Thiele [1998]:
A branch and bound algorithm for the resource-constrained project
scheduling problem, European Journal of Operational Research 107, 272-288.
C. Artigues, P. Brucker, S. Knust, O. Kone, P. Lopez, M. Mongeau [2013]:
A note on ``event-based MILP models for resource-constrained project
scheduling problems'',
Computers and Operations Research 40, 1060-1063.
Heuristic algorithms
T. Baar, P. Brucker, S. Knust [1998]:
Tabu-search algorithms and lower bounds for the resource-constrained
project scheduling problem,
in: S.Voss, S.Martello, I.Osman, C.Roucairol (eds.): Meta-heuristics:
Advances and Trends in Local Search Paradigms for Optimization, Kluwer, 1-18.
P. Brucker, S. Knust [1998]:
Solving large-sized resource-constrained project scheduling problems,
in: J.Weglarz (ed.): Project Scheduling: Recent Models, Algorithms and
Applications, Kluwer, 27-51.
Lower bounds
T. Baar, P. Brucker, S. Knust [1998]:
Tabu-search algorithms and lower bounds for the resource-constrained
project scheduling problem,
in: S.Voss, S.Martello, I.Osman, C.Roucairol (eds.): Meta-heuristics:
Advances and Trends in Local Search Paradigms for Optimization, Kluwer, 1-18.
P. Brucker, S. Knust [2000]:
A linear programming and constraint propagation-based lower bound for the
RCPSP, European Journal of Operational Research 127, 355-362.
P. Brucker, S. Knust [2003]:
Lower bounds for resource-constrained project scheduling problems,
European Journal of Operational Research 149, 302-313.
Applications
P. Brucker, S. Knust [2001]:
Resource-constrained project scheduling and timetabling,
in: E.Burke, W.Erben (ed.): The Practice and Theory of Automated Timetabling
III, Springer Lecture Notes in Computer Science Vol. 2079, 277-293.
S. Knust [2010]:
Scheduling non-professional table-tennis leagues,
European Journal of Operational Research 200, 358-367.
Projects:
Resource-constrained project scheduling: Models, methods and
applications; Complex machine-scheduling problems DFG (1996-2001)
Involved:
Prof. Dr. Peter Brucker (Osnabrück);
Prof. Dr. Andreas Drexl (Kiel);
Prof. Dr. Rolf Möhring (Berlin);
Prof. Dr. Klaus Neumann (Karlsruhe);
Prof. Dr. Erwin Pesch (Bonn)
