Advertisement

A Metaheuristic Approach to the Resource Constrained Project Scheduling with Variable Activity Durations and Convex Cost Functions

  • Koji Nonobe
  • Toshihide Ibaraki
Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 92)

Abstract

We introduce a generalized model of the resource constrained project scheduling problem (RCPSP). It features that (i) the duration of an activity is not constant, but can vary in a specified range, and (ii) the objective is to minimize a convex function of time-lag costs, where a time-lag cost is charged according to the difference between the start/completion times of activities. These features achieve the flexibility of the model. It is known that, in the RCPSP, resource constraints can be replaced by some precedence constraints appropriately defined between the activities that require a common scarce resource. If we remove resource constraints by precedence constraints, our problem can be formulated as the dual problem of a minimum cost flow problem, and thus can be solved efficiently. Exploiting this property, we design a heuristic algorithm based on local search. We conducted computational experiments with benchmark instances to minimize the weighted earliness-tardiness costs, as well as instances in which activity-crashing or relaxation of temporal constraints are allowed. These results indicate the usefulness of our generalized RCPSP model and the proposed algorithm.

Keywords

Resource constrained project scheduling convex objective functions variable activity durations metaheuristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall.Google Scholar
  2. Ahuja, R.K., Hochbaum, D.S. and Orlin, J.B. (1999). Solving the convex cost integer dual network flow problem. in: Lecture Notes in Computer Science 1610 (IPCO’99), G. Cornuejols, R.E. Burkard and G.J. Woeginger, eds, pp. 31–44.Google Scholar
  3. Bartusch, M., Möhring, R.H. and Radermacher, F.J. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research 16:201–240.CrossRefMathSciNetGoogle Scholar
  4. Brucker, P., Drexl, A., Möhring, R., Neumann, K. and Pesch, E. (1999). Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research 112:3–41.CrossRefGoogle Scholar
  5. Bertsekas, D.P. and Tseng, P. (1994). RELAX-IV: A faster version of the RELAX code for solving minimum cost flow problems. Laboratory for Information and Decision Systems Report P-2276, Massachusetts Institute of Technology, Cambridge.Google Scholar
  6. Cherkassky, B.V. and Goldberg, A.V. (1997). On implementing push-relabel method for the maximum flow problem. Algorithmica 19:390–410.CrossRefMathSciNetGoogle Scholar
  7. Demeulemeester, E.L. and Herroelen, W.S. (2002). Project Scheduling: A Research Handbook, Kluwer, Boston.zbMATHGoogle Scholar
  8. De Reyck, B. and Herroelen, W. (1998). A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Reserch 111:152–174.CrossRefGoogle Scholar
  9. Herroelen, W., De Reyck, B. and Demeulemeester, E.L. (1998). Resource-constrained project scheduling: A survey of recent developments. Computers and Operations Research 25:279–302.CrossRefMathSciNetGoogle Scholar
  10. Klein, R. (2000). Scheduling of Resource-Constrained Projects, Kluwer, Boston.zbMATHGoogle Scholar
  11. McCormick, S.T. and Ervolina, T.R. (1994). Computing maximum mean cuts. Discrete Applied Mathematics 52:53–70.CrossRefMathSciNetGoogle Scholar
  12. Neumann, K., Schwindt, C. and Zimmermann, J. (2002). Project Scheduling with Time Windows and Scarce Resources, Springer, Berlin.Google Scholar
  13. Neumann, K., Schwindt, C. and Zimmermann, J. (2003). Order-based neighborhoods for project scheduling with nonregular objective functions, European Journal of Operational Research 149:325–343.CrossRefMathSciNetGoogle Scholar
  14. Schwindt C. (1998). Generation of resource-constrained project scheduling problems subject to temporal constraints. Report WIOR-543, Institute for Economic Theory and Operations Research, University of Karlsruhe.Google Scholar
  15. Schwindt, C. (1999). Minimizing earliness-tardiness costs of resource-constrained projects, in: Operations Research Proceedings, K. Inderfurth, G. Schwoe-diauer, W. Domschke, F. Juhnke, P. Kleinschmidt and G. Waescher, eds, Springer, pp. 402–407.Google Scholar
  16. Vanhoucke, M., Demeulemeester, E. and Herroelen, W. (2001). An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem. Annals of Operations Research 102:179–196.CrossRefMathSciNetGoogle Scholar
  17. Weglarz, J. (ed.) (1999). Project scheduling: Recent Models, Algorithms, and Applications, Kluwer, Boston.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2006

Authors and Affiliations

  • Koji Nonobe
    • 1
  • Toshihide Ibaraki
    • 2
  1. 1.Department of Art and Technology, Faculty of EngineeringHosei UniversityKoganei, TokyoJapan
  2. 2.Department of Informatics, School of Science and TechnologyKwansei Gakuin UniversitySanda, HyogoJapan

Personalised recommendations