Uncertain Resource Availabilities: Proactive and Reactive Procedures for Preemptive Resource Constrained project Scheduling Problem

Subject Areas : Statistics

M.  Fallah ¹ (Department of Industrial Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran.)

Received: 2015-04-14 Accepted : 2015-12-16 Published : 2015-03-21

Keywords: سطح دسترسی احتمالی از منابع, روش‌های پیشگیرانه, سیاست‌های واکنش,

Abstract :

Project scheduling is the part of project management that deals with determining when intime to start (and finish) which activities and with the allocation of scarce resources to theproject activities. In practice, virtually all project managers are confronted with resourcescarceness. In such cases, the Resource-Constrained Project Scheduling Problem (RCPSP)arises. This optimization problem has become popular over the last few decades because ofits practical relevance to various industrial and research fields. Numerous procedures havebeen developed in the literature for finding either optimal or heuristic solutions for theRCPSP.Resource constrained project scheduling problem under stochastic circumstances have beenconsidered in recent decades where uncertainty is modeled by means of activities’ duration.In this research we study an extension of basic stochastic RCPSP in which availability ofresources is not predefined. Activities follow preempt-resume mode in case of any disruptiondue to resource infeasibility. A solution for this variant of RCPSP is defined in three steps byutilizing heuristic procedures for creating initial schedule, adding time and resource buffers inorder to yield proactive schedule and applying reactive policies to encounter with unhandledbreakdowns. Computational experiments depict that proposed combined procedure achievesignificant performance gains over the use of each method separately.

References:

Akturk, M. S., andGorgulu, E. (1999).Match-up scheduling under a machine breakdown. European Journal of Operational Research,112, 81–97.

Al-Fawzan,M. A., andHaouari, M. (2005).A bi-objective model for robust resource constrained project scheduling. International Journalof Production Economics, 96, 175- 187

Ashtiani, B., Leus, R. andAryanezhd, M, B. (2009).New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing. Journal of Scheduling, to appear.

Ballestín, F. (2007).When it is worthwhile to work with the stochastic RCPSP?. Journal of Scheduling, 10(3), 153–166.

Brucker, P., Drexl, A., Möhring, R., Neumann, K., andPesch, E. (1999).Resource-constrained project scheduling: notation, classification, models and methods. European Journal of Operational Research,112, 3-41.

Demeulemeester, E., andHerroelen, W. (1997).New benchmark results for the resource-constrained project scheduling problem. ManagementScience, 43, 1485– 1492.

Demeulemeester, E., andHerroelen, W. (2002).International series in operations research & management science: Vol. 49. Project scheduling-a research handbook. Boston: Kluwer Academic. Drexl, A. (1991). Scheduling of project networks by job assignment.Management Science, 37, 1590–1602.

Drezet, L.-E. (2005). Résolution d’un problème de gestion de projetssous contraintes de ressourceshumaines: de l’approchepredictive à l’approcheréactive. PhD thesis.Université François RabelaisTours, France.

Fernandez, A. A., Armacost, R. L., and PetEdwards, J. (1998).Understanding simulation solutions to resource constrained project scheduling problems with stochastic task durations. EngineeringManagement Journal, 10, 5–13.

Forrester, J. W. (1961). Industrial Dynamics.MIT Press. Goldratt, E. (1997). Critical Chain, North River Press. Hartmann, S. (1998).A competitive genetic algorithm for resource-constrained project scheduling.Naval Research Logistics, 45, 733–750.