Resource dedication problem in a multi-project environment
- 702 Downloads
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.
KeywordsMulti-project scheduling Resource dedication problem Resource preference Lagrangian relaxation MRCPSP
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.
- 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
- Talbot F B (1982) Resource-constrained project scheduling with time-resource trade-offs: the nonpreemptive case. Manag Sci 28(10):1199–1210Google Scholar