Abstract
A recurring problem in project management involves the allocation of scarce resources to the individual activities comprising the project. In many situations such as audit-staff scheduling or timetabling, the resources correspond to individuals (skilled labour). This naturally leads to an assignment-type project scheduling problem, i.e. a project has to be performed by assigning one or more of several individuals (resources) to each activity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baar, T., P. Brucker, and S. Knust. 1997. Tabu-search algorithms for the resource-constrained project scheduling problem. Working Paper, Universität Osnabrück.
Bartusch, M., R.H. Möhring, and F.F. Radermacher. 1988. Scheduling project networks with resource constraints and time windows. Annals Oper. Res. 16, 201–240.
Błażewicz, J., W. Cellary, R. Słowiński, and J. Węglarz. 1986. Scheduling under Resource Constraints — Deterministic Models, Baltzer, Basel (Annals Oper. Res. 7).
Błażewicz, J., K.H. Ecker, E. Pesch, G. Schmidt, and J. Węglarz. 1996. Scheduling Computer and Manufacturing Processes, Springer, Berlin.
BÖttcher, J., A. Drexl, R. Kolisch, and F. Salewski. 1996. Project scheduling under partially renewable resource constraints. Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No. 398.
Brinkmann, K., and K. Neumann. 1994. Heuristic procedures for resource-constrained project scheduling with minimal and maximal time lags: The minimum project-duration and resource-levelling problems. Report WIOR-443, Universität Karlsruhe.
Brucker, P., S. Knust, A. Schoo, and O. Thiele. 1998. A branch & bound algorithm for the resource-constrained project scheduling problem, European J. Oper. Res. (to appear).
Demeulemeester, E. 1995. Minimizing resource availability costs in time-limited project networks. Mgmt. Sci. 41, 1590–1598.
Demeulemeester, E., and W. Herroelen. 1992. A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Mgmt. Sci. 38, 1803–1818.
Demeulemeester, E., andW. Herroelen. 1997. New benchmark results for the resource-constrained project scheduling problem. Mgmt. Sci. 43, 1485–1492.
De Reyck, B., and W. Herroelen. 1997. The multi-mode resource-constrained project scheduling problem with generalized precedence constraints. Working Paper, Katholieke Universiteit Leuven.
Dodin, B., and A.A. Elimam. 1997. Audit scheduling with overlapping activities and sequence dependent setup costs. European J. Oper. Res. 97, 22–33.
Dodin, B., A.A. Elimam, and F. Rolland. 1996. Tabu search in audit scheduling. Working Paper, University of California/Riverside.
Drexl, A. 1991. Scheduling of project networks by job assignment. Mgmt. Sci. 37, 1590–1602.
Drexl, A., J. Juretzka, and F. Salewski. 1993. Academic course scheduling under workload and changeover constraints. Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No. 337.
Drexl, A., and F. Salewski. 1997. Distribution requirements and compactness constraints in school timetabling. European J. Oper. Res. 102, 193–214.
Elmaghraby, S.E. 1977. Activity Networks — Project Planning and Control by Network Models, Wiley, New York.
Franck, B., K. Neumann, and C. Schwindt. 1997. A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods. OR Spektrum 19, 77–85.
Icmeli, O., and S.S. Erengüc. 1994. A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows. Computers & Oper. Res. 21, 841–853.
Icmeli, O., and S.S. Erengüc. 1996. A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows. Mgmt. Sci. 42, 1395–1408.
Icmeli, O., and W. Rom. 1996. Solving the resource constrained project scheduling problem with optimization subroutine library. Working Paper, Cleveland State University.
Klein, R., and A. Scholl. 1997. Computing lower bounds by destructive improvement — An application to resource-constrained project scheduling. Working Paper, Technische Hochschule Darmstadt, European J. Oper. Res. (to appear).
Kolisch, R. 1995. Project Scheduling under Resource Constraints — Efficient Heuristics for Several Problem Classes, Physica, Heidelberg.
Kolisch, R. 1996a. Efficient priority rules for the resource-constrained project scheduling problem. J. Operations Management 14, 179–192.
Kolisch, R. 1996b. Serial and parallel resource-constrained project scheduling methods revisited — Theory and computation. European J. Oper. Res. 90, 320–333.
Kolisch, R., and A. Drexl. 1996. Adaptive search for solving hard project scheduling problems. Naval Res. Logist. 43, 23–40.
Kolisch, R., A. Sprecher, and A. Drexl. 1995. Characterization and generation of a general class of resource-constrained project scheduling problems. Mgmt. Sci. 41, 1693–1703.
Mingozzi, A., V. Maniezzo, S. Ricciardelli, and L. Bianco. 1997. An exact algorithm for the resource constrained project scheduling problem based on a new mathematical formulation, Mgmt. Sci. (to appear).
Neumann, K., and J. Zhan. 1995. Heuristics for the minimum project-duration problem with minimal and maximal time lags under fixed resource constraints. J. Intelligent Manufacturing 6, 145–154.
Patterson, J.H. 1984. A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem. Mgmt. Sci. 30, 854–867.
Patterson, J.H., F.B. Talbot, R. Słowiński, and J. Węglarz. 1990. Computational experience with a backtracking algorithm for solving a general class of resource constrained scheduling problems. European J. Operational Research 90, 68–79.
Pritsker, A.A.A., W.D. Watters, and P.M. Wolfe. 1969. Multiproject scheduling with limited resources: A zero-one programming approach. Mgmt. Sci. 16, 93–110.
Salewski, F. 1995. Hierarchische Personaleinsatzplanung in Wirtschaftsprü-fungsgesellschaften, Physica, Heidelberg.
Salewski, F., A. Schirmer, and A. Drexl. 1997. Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application. European J. Oper. Res. 102, 88–110.
Schirmer, A., and A. Drexl. 1997. Allocation of partially renewable resources — Concept, models and application. Manuskripte aus den Instituten fur Betriebswirtschaftslehre der Universität Kiel, No. 455.
Sprecher, A. 1994. Resource-Constrained Project Scheduling — Exact Methods for the Multi-Mode Case, Springer, Berlin.
Sprecher, A. 1996. Solving the RCPSP efficiently at modest memory requirements. Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, No. 426.
Sprecher, A., and A. Drexl. 1998. Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm. European J. Oper. Res. (to appear).
Sprecher, A., S. Hartmann, and A. Drexl. 1997. An exact algorithm for project scheduling with multiple modes. OR Spektrum 19, 195–203.
Talbot, F.B. 1982. Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Mgmt. Sci. 28, 1197–1210.
Zimmermann, J. 1997. Heuristics for resource-levelling problems in project scheduling with minimum and maximum time lags. Report WIOR-491, Universität Karlsruhe.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Drexl, A., Juretzka, J., Salewski, F., Schirmer, A. (1999). New Modelling Concepts and Their Impact on Resource-Constrained Project Scheduling. In: Węglarz, J. (eds) Project Scheduling. International Series in Operations Research & Management Science, vol 14. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5533-9_18
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5533-9_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7529-6
Online ISBN: 978-1-4615-5533-9
eBook Packages: Springer Book Archive