title   
  

Resource dedication problem in a multi-project environment

Beşikci, Umut and Bilge, Ümit and Ulusoy, Gündüz (2013) Resource dedication problem in a multi-project environment. Flexible Services and Manufacturing Journal (Sl), 25 (1-2). pp. 206-229. ISSN 1936-6582 (Print) 1936-6590 (Online)

This is the latest version of this item.

[img]PDF (Research Paper) - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
437Kb
[img]PDF (This is a RoMEO green journal -- author can archive post-print (ie final draft post-refereeing)) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
683Kb

Official URL: http://dx.doi.org/10.1007/s10696-012-9140-9

Abstract

There can be different approaches to the management of resources within the context of multi-project scheduling problems. In general, approaches to multiproject 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.

Item Type:Article
Uncontrolled Keywords:Multi-project scheduling; Resource dedication problem; Resource preference; Lagrangian relaxation; MRCPSP
Subjects:T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering
ID Code:20012
Deposited By:Gündüz Ulusoy
Deposited On:09 Nov 2012 12:30
Last Modified:25 Sep 2014 15:10

Available Versions of this Item

Repository Staff Only: item control page