AN EXACT ALGORITHM FOR THE MODE IDENTITY PROJECT SCHEDULING PROBLEM

In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project scheduling problem with mode identity. The proposed algorithm is extended with some bounding rules to reduce the size of branch and bound tree. Finally, some test problems are solved and their computational results are reported.

[1]  Arno Sprecher,et al.  Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm , 1998, Eur. J. Oper. Res..

[2]  Michael C. Georgiadis,et al.  MILP formulations for single- and multi-mode resource-constrained project scheduling problems , 2012, Comput. Chem. Eng..

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

[4]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .

[5]  James H. Patterson,et al.  ProGen/pix - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions , 2000, Eur. J. Oper. Res..

[6]  Andreas Drexl,et al.  Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application , 1997 .

[7]  F. Brian Talbot,et al.  Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .

[8]  Arno Sprecher,et al.  An exact algorithm for project scheduling with multiple modes , 1997 .

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

[10]  Arno Sprecher,et al.  Resource-Constrained Project Scheduling: Exact Methods for the Multi-Mode Case , 1994 .

[11]  Bert De Reyck,et al.  An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations , 1998, Comput. Oper. Res..

[12]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[13]  Ulrich Dorndorf,et al.  Project Scheduling with Time Windows: From Theory to Applications , 2002 .

[14]  Roland Heilmann,et al.  Discrete Optimization A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags , 2002 .

[15]  Mario Vanhoucke,et al.  Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers , 2011, Eur. J. Oper. Res..

[16]  Bert De Reyck,et al.  The multi-mode resource-constrained project scheduling problem with generalized precedence relations , 1999, Eur. J. Oper. Res..

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

[18]  Roland Heilmann.  Resource–constrained project scheduling: a heuristic for the multi–mode case , 2001, OR Spectr..

[19]  Richard F. Deckro,et al.  Planning and re-planning in project and production scheduling☆ , 2002 .

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

[21]  Sönke Hartmann,et al.  Project scheduling with multiple modes: A comparison of exact algorithms , 1998, Networks.

[22]  Frank Salewski,et al.  8 New Modelling Concepts and Their Impact on Resource{constrained Project Scheduling Background and Motivation , 1998 .

[23]  Carlo Vercellis,et al.  Hierarchical models for multi-project planning and scheduling , 1993 .

[24]  Francisco Ballestín,et al.  A double genetic algorithm for the MRCPSP/max , 2011, Comput. Oper. Res..