Abstract
Crew or staff scheduling is a complex combinatorial problem. It consists of assigning tasks to persons which have to perform these task and to schedule the performance of the tasks. Railway and airline crew scheduling problems, audit scheduling problems, school and university course scheduling and staff scheduling in hospitals are typical examples of such combinatorial problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R., Magnanti, T., Orlin, L.: Network Flows: Theory, Algorithms and Application. Prentice-Hall, Englewood Cliffs, NJ (1993)
Brucker, P.: Scheduling Algorithms. Springer-Verlag, Berlin Heidelberg New York (1998)
Brucker, P.: Complex Scheduling Problems Osnabr”ucker Schriften zur Mathematik, Reihe P, Heft 214 (1999)
Brucker, P., Drexl, A., M”ohring, R., Neumann, K., Pesch, E.: Resource-Constrained Project Scheduling: Notation, Classification, Models and Methods. Eur. J. Oper. Res. 112 (1999) 3–14
Brucker, P., Jurisch, B., Sievers, B.: A Branch & Bound Algorithm for the Job-Shop Problem. Discrete Appl. Math. 49 (1994) 107–127
Brucker, P., Schumacher, D.: A New Tabu Search Procedure for an Audit-Scheduling Problem. J. Scheduling 2 (1999) 157–173
Carlier, J., Neron, E.: An Exact Method for Solving the Multi-Processor Flow-Shop. RAIRO Oper. Res. 34 (2000) 1–25
Carlier, J., Pinson, E.: An Algorithm for Solving the Job-Shop Problem. Manage. Sci. 35 (1989) 164–176
Dorndorf, U., Phan Huy, T., Pesch, E.: A Survey of Interval Capacity Consistency Tests for Time-and Resource-Constrained Scheduling. In: Węglarz J. (ed.): Handbook on Recent Advances in Project Scheduling. Kluwer, Dordrecht (1999) 213–238
Dorndorf, U., Pesch, E., Phan Huy, T.: Solving the Open Shop Scheduling Problem. J. Scheduling (1999) (to appear)
Even, S., Itai, A., Shamir, A.: On the Complexity of Timetabling and Multicommodity Flow Problems. SIAM J. Comput. 5 (1976) 691–703
Goltz, H.-J., Matzke, D.: University Timetabling Using Constraint Logic Programming. In: Gupta G. (ed.): Practical Aspects of Declarative Languages. Lecture Notes in Computer Science, Vol. 1551. Springer-Verlag, Berlin Heidelberg New York (1999) 320–334
Kolisch, R.: Serial and Parallel Resource-Constrained Project S cheduling Methods Revisited: Theory and Computation. Eur. J. Oper. Res. 90 (1996) 320–333
Kolisch, R., Hartmann, S.: Heuristic algorithms for the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis. In: Węglarz J. (ed.): Handbook on Recent Advances in Project Scheduling. Kluwer, Dordrecht (1999) 147–178
Martin, P.B., Shmoys, D.B.: A New Approach to Computing Optimal Schedules for the Job Shop Scheduling Problem. Proc. 5th Int. IPCO Conference (1996)
Schaerf, A.: A Survey of Automated Timetabling. CWI-Report CS-R 9567. Amsterdam (1995)
Schaerf, A.: Tabu Search Techniques for Large High-School Time-Tabling Problems. CWI-Report CS-R 9611. Amsterdam (1996)
Sprecher, A., Drexl, A.: Solving Multi-mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequencing Algorithm. Eur. J. Oper. Res. 107 (1998) 431–450
de Werra, D.: An Introduction to Timetabling. Eur. J. Oper. Res. 19 (1985) 151–162
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brucker, P., Knust, S. (2001). Resource-Constrained Project Scheduling and Timetabling. In: Burke, E., Erben, W. (eds) Practice and Theory of Automated Timetabling III. PATAT 2000. Lecture Notes in Computer Science, vol 2079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44629-X_17
Download citation
DOI: https://doi.org/10.1007/3-540-44629-X_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42421-5
Online ISBN: 978-3-540-44629-3
eBook Packages: Springer Book Archive