Advertisement

Mathematical Methods of Operations Research

, Volume 52, Issue 3, pp 467–488 | Cite as

PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem

  • Robert Klein
  • Armin Scholl

Abstract.

This paper deals with the generalized resource-constrained project scheduling problem (GRCPSP) which extends the well-known resource-constrained project scheduling problem (RCPSP) by considering job specific release and due dates, non-negative minimum start-to-start time lags as well as time-varying resource availabilities. The structure of the project is represented by an acyclic network diagram. Though the extensions are of high practical importance, only a few exact solution procedures have been presented in the literature so far. Therefore, a new exact procedure PROGRESS is developed which includes new dominance rules as well as enhancements of existing ones. For evaluating the efficiency experimentally, new GRCPSP instances with 30 and 60 jobs are considered which extend the standard benchmark sets for the RCPSP generated by ProGen. PROGRESS shows superior performance when applied to the GRCPSP and is also very competitive in comparison to approaches proposed for the RCPSP.

Key words: Resource-Constrained Project Scheduling, Branch and Bound 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Robert Klein
    • 1
  • Armin Scholl
    • 1
  1. 1.Darmstadt University of Technology, Hochschulstr. 1, D-64289 Darmstadt, Germany (email: rklein@bwl.tu-darmstadt.de)DE

Personalised recommendations