Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement

A lot of projects in real life are subject to some kinds of nonrenewable resources that are not exactly similar to the type defined in the project scheduling literature. The difference stems from the fact that, in those projects, contrary to the common assumption in the project scheduling literature, nonrenewable resources are not available in full amount at the beginning of the project, but they are procured along the project horizon. In this paper, we study this different type of nonrenewable resources. To that end, we extend the resource constrained project scheduling problem (RCPSP) by this resource type (RCPSP-NR) and customize four basic branch and bound algorithms of RCPSP for it, including precedence tree, extension alternatives, minimal delaying alternatives, and minimal forbidden sets. Several bounding and fathoming rules are introduced to the algorithms to shorten the enumeration process. We perform comprehensive experimental analysis using the four customized algorithms and also CPLEX solver.

[1]  Chen Fang,et al.  An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem , 2012, Comput. Oper. Res..

[2]  Federico Barber,et al.  An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes , 2009 .

[3]  Ramón Alvarez-Valdés,et al.  GRASP and path relinking for project scheduling under partially renewable resources , 2008, Eur. J. Oper. Res..

[4]  E. W. Davis,et al.  Multiple Resource–Constrained Scheduling Using Branch and Bound , 1978 .

[5]  Mario Vanhoucke,et al.  A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem , 2010, Eur. J. Oper. Res..

[6]  Michel Gagnon,et al.  Resource-constrained project scheduling through the goal programming model: integration of the manager's preferences , 2012, Int. Trans. Oper. Res..

[7]  Federico Barber,et al.  Multi-mode resource constrained project scheduling: scheduling schemes, priority rules and mode selection rules , 2006, Inteligencia Artif..

[8]  J. H. Patterson,et al.  An Algorithm for a general class of precedence and resource constrained scheduling problems , 1989 .

[9]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[10]  Jörg Homberger,et al.  A multi-agent system for the decentralized resource-constrained multi-project scheduling problem , 2007, Int. Trans. Oper. Res..

[11]  Jan BottcherAndreas.  Project Scheduling Under Partially Renewable Resource Constraints , 1999 .

[12]  Rema Padman,et al.  An integrated survey of deterministic project scheduling , 2001 .

[13]  Ramón Alvarez-Valdés,et al.  A scatter search algorithm for project scheduling under partially renewable resources , 2006, J. Heuristics.

[14]  James E. Kelley,et al.  Critical-path planning and scheduling , 1899, IRE-AIEE-ACM '59 (Eastern).

[15]  Grzegorz Waligóra,et al.  Project scheduling with finite or infinite number of activity processing modes - A survey , 2011, Eur. J. Oper. Res..

[16]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

[17]  Linus Schrage,et al.  Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case , 1970, Oper. Res..

[18]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[19]  Can Akkan,et al.  Network decomposition-based benchmark results for the discrete time-cost tradeoff problem , 2005, Eur. J. Oper. Res..

[20]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[21]  Albert Battersby,et al.  Advances in Critical Path Methods , 1966 .

[22]  Philip M. Wolfe,et al.  Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach , 1969 .

[23]  Franz Josef Radermacher,et al.  Preselective strategies for the optimization of stochastic project networks under resource constraints , 1983, Networks.

[24]  Andreas Drexl,et al.  Allocation of partially renewable resources: Concept, capabilities, and applications , 2001, Networks.

[25]  Taïcir Loukil,et al.  Differential evolution for solving multi-mode resource-constrained project scheduling problems , 2009, Comput. Oper. Res..

[26]  Rainer Kolisch,et al.  Experimental investigation of heuristics for resource-constrained project scheduling: An update , 2006, Eur. J. Oper. Res..

[27]  John F. Muth,et al.  A Dynamic Programming Algorithm for Decision CPM Networks , 1979, Oper. Res..

[28]  Rainer Kolisch,et al.  Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem , 2000, Eur. J. Oper. Res..

[29]  Claude Le Pape,et al.  Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems , 1994 .

[30]  Gang Yu,et al.  A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem , 2006, INFORMS J. Comput..

[31]  Francisco Ballestín,et al.  An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags , 2011, J. Sched..

[32]  Sönke Hartmann,et al.  A survey of variants and extensions of the resource-constrained project scheduling problem , 2010, Eur. J. Oper. Res..