Resource dedication problem in a multi-project environment

Article

Abstract

There can be different approaches to the management of resources within the context of multi-project scheduling problems. In general, approaches to multi-project scheduling problems consider the resources as a pool shared by all projects. On the other hand, when projects are distributed geographically or sharing resources between projects is not preferred, then this resource sharing policy may not be feasible. In such cases, the resources must be dedicated to individual projects throughout the project durations. This multi-project problem environment is defined here as the resource dedication problem (RDP). RDP is defined as the optimal dedication of resource capacities to different projects within the overall limits of the resources and with the objective of minimizing a predetermined objective function. The projects involved are multi-mode resource constrained project scheduling problems with finish to start zero time lag and non-preemptive activities and limited renewable and nonrenewable resources. Here, the characterization of RDP, its mathematical formulation and two different solution methodologies are presented. The first solution approach is a genetic algorithm employing a new improvement move called combinatorial auction for RDP, which is based on preferences of projects for resources. Two different methods for calculating the projects’ preferences based on linear and Lagrangian relaxation are proposed. The second solution approach is a Lagrangian relaxation based heuristic employing subgradient optimization. Numerical studies demonstrate that the proposed approaches are powerful methods for solving this problem.

Keywords

Multi-project scheduling Resource dedication problem Resource preference Lagrangian relaxation MRCPSP 

Notes

Acknowledgments

We gratefully acknowledge the support given by the Scientific and Technological Research Council of Turkey (TUBITAK) through Project Number MAG 109M571 and Bogazici University Scientific Research Projects (BAP) through Project Number O9HA302D.

References

  1. Alcaraz J, Marato C, Ruiz R (2003) Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. J Oper Res Soc 54:614–626MATHCrossRefGoogle Scholar
  2. Boctor FF (1993) Heuristics for scheduling projects with resource restrictions and several resource-duration modes. Int J Prod Res 31(11):2547–2558CrossRefGoogle Scholar
  3. Bouleimen K, Lecocq H (1998) A new efficient simulated annealing algorithm for the resource constrained project scheduling problem and its multiple mode version. In: Barbarosoğlu G, Karabati S, Ozdamar L, Ulusoy G (eds) Proceedings of the sixth international workshop on project management and scheduling 49:268–281Google Scholar
  4. Brucker P, Drexl A, Mohring R, Neumann K, Pesch E (1999) Resource constrained project scheduling: notation, classification, models and methods. Eur J Oper Res 112:3–41MATHCrossRefGoogle Scholar
  5. Goncalves JF, Mendes JJM, Resende MGC (2008) A genetic algorithm for resource constrained multi-project scheduling problem. Eur J Oper Res 189:1171–1190MATHCrossRefGoogle Scholar
  6. Hartmann S (2001) Project scheduling with multiple modes: a genetic algorithm. Ann Oper Res 102:111–135MathSciNetMATHCrossRefGoogle Scholar
  7. Herroelen W, DeReyck B, Demeulemeester E (1998) Resource constrained project scheduling: a survey of recent developments. Comput Oper Res 25:279–302MathSciNetMATHCrossRefGoogle Scholar
  8. Jozefowska J, Mika M, Rozycki R, Waligora G, Weglarz J (2001) Simulated annealing for multi-mode resource-constrained project scheduling problem. Ann Oper Res 102:137–155MathSciNetMATHCrossRefGoogle Scholar
  9. Kim SY, Leachman RC (1993) Multi-project scheduling with explicit lateness costs. IIE Trans 25(2):34–44CrossRefGoogle Scholar
  10. Kolisch R, Sprecher A, Drexl A (1995) Characterization and generation of a general class of resource-constrained project scheduling problems. Manag Sci 41(10):1693–1703MATHCrossRefGoogle Scholar
  11. Kolisch R, Sprecher A (1996) PSPLIB—a project scheduling problem library. Eur J Oper Res 96:205–216CrossRefGoogle Scholar
  12. Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. OMEGA 29:249–272CrossRefGoogle Scholar
  13. Kurtulus IS, Narula SC (1985) Multi-project scheduling: analysis of project performance. IIE Trans 17(1):58–66CrossRefGoogle Scholar
  14. Lawrance SR, Morton TE (1993) Resource-constrained multi-project scheduling with tardy-costs: comparing myopic, bottleneck, and resource pricing heuristics. Eur J Oper Res 64:168–187CrossRefGoogle Scholar
  15. Lova A, Maroto C, Tormos P (2000) A multicriteria heuristic method to improve resource allocation in multiproject environment. Eur J Oper Res 127:408–424MATHCrossRefGoogle Scholar
  16. Lova A, Tormos P, Cervantes M, Barber F (2009) An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. Int J Prod Econ 117(2):302–316CrossRefGoogle Scholar
  17. Mingozzi A, Maniezzo V, Ricciardelli S, Bianco L (1998) An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manag Sci 44(5):714–72MATHCrossRefGoogle Scholar
  18. Mittal ML, Kanda A (2009) Two phase heuristics for scheduling of multiple projects. Int J Oper Res 4(2):159–177MATHCrossRefGoogle Scholar
  19. Mori M, Tseng CC (1997) A genetic algorithm for multi-mode resource constrained project scheduling problem. Eur J Oper Res 100:134–141MATHCrossRefGoogle Scholar
  20. Ozdamar L, Ulusoy G (1995) A survey on the resource-constrained project scheduling problem. IIE Trans 27(5):574–586CrossRefGoogle Scholar
  21. Pritsker AAB, Watters LJ, Wolfe PM (1969) Multiproject scheduling with limited resources: a zero-one programming approach. Manag Sci 16(1):93–108CrossRefGoogle Scholar
  22. Speranza MG, Vercellis C (1993) Hierarchical models for multi-project planning and scheduling. Eur J Oper Res 64:312–325MATHCrossRefGoogle Scholar
  23. Sprecher A, Hartmann S, Drexl A (1997) An exact algorithm for project scheduling with multiple modes. OR Spektrum 19:195–203MathSciNetMATHCrossRefGoogle Scholar
  24. Sprecher A, Drexl A (1998) Multi-mode resource-constrained project scheduling by a simple and powerful sequencing algorithm. Eur J Oper Res 107:431–450MATHCrossRefGoogle Scholar
  25. Talbot F B (1982) Resource-constrained project scheduling with time-resource trade-offs: the nonpreemptive case. Manag Sci 28(10):1199–1210Google Scholar
  26. Tsubakitani S, Deckro RF (1990) A heuristic approach for multi-project scheduling with limited resources in the housing industry. Eur J Oper Res 49:80–91CrossRefGoogle Scholar
  27. Yang KK, Sum CC (1997) An evolution of due date, resource allocation, project release and activity scheduling rules in a multiproject environment. Eur J Oper Res 103:139–154MATHCrossRefGoogle Scholar
  28. Zapata JC, Hodge BM, Reklaitis GV (2008) The multimode resource constrained multiproject scheduling problem: alternative formulations. AlChe J 54(8):2101–2119CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Bogazici UniversityIstanbulTurkey
  2. 2.Sabancı UniversityIstanbulTurkey

Personalised recommendations