A priority-rule method for project scheduling with work-content constraints

The activities of a project are in general characterized by a work content in terms of resource-time units, e.g. person-days. Even though most project scheduling models assume a time-invariant resource usage, normally it is possible to vary the resource usage during the execution of an activity. Typically, a lower and an upper bound on this resource usage and a minimum time lag between consecutive changes of this resource usage are prescribed. The project scheduling problem studied in this paper consists in determining a feasible resource-usage profile for each activity such that the project duration is minimized subject to precedence and resource-capacity constraints. While the known solution methods interpret the prescribed work content as a lower bound, we assume that each activity's work content must be processed exactly. We propose a priority-rule scheduling method that iteratively determines a feasible resource-usage profile for each activity. We present a consistency test for constructing such profiles more efficiently. Our computational results demonstrate that the new method solves more instances to feasibility than two benchmark procedures, and is suited for project instances with up to 200 activities.

[1]  Jacques A. Ferland,et al.  Activity list representation for a generalization of the resource-constrained project scheduling problem , 2009, Eur. J. Oper. Res..

[2]  Erik Demeulemeester,et al.  Resource-constrained project scheduling: A survey of recent developments , 1998, Comput. Oper. Res..

[3]  Jan Węglarz,et al.  Project scheduling : recent models, algorithms, and applications , 1999 .

[4]  Francisco Ballestín,et al.  Pre-emption in resource-constrained project scheduling , 2008, Eur. J. Oper. Res..

[5]  Tamás Kis,et al.  Project scheduling approach to production planning , 2003 .

[6]  Mario Vanhoucke,et al.  Vlerick Leuven Gent Working Paper Series 2006/15 the Impact of Various Activity Assumptions on the Lead-time and Resource Utilization of Resource-constrained Projects the Impact of Various Activity Assumptions on the Lead-time and Resource Utilization of Resource-constrained Projects Vlerick Leuven , 2022 .

[7]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[8]  Erik Demeulemeester,et al.  Local search methods for the discrete time/resource trade‐off problem in project networks , 1998 .

[9]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[10]  Cord-Ulrich Fündeling.  Ressourcenbeschränkte Projektplanung bei vorgegebenen Arbeitsvolumina , 2006 .

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

[12]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

[13]  Mohammad Ranjbar,et al.  Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms , 2007, Appl. Math. Comput..

[14]  HONGQI PAN,et al.  A hybrid henetic algorithm for project scheduling , 2001 .

[15]  Klaus Neumann,et al.  Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling , 2001, OR Spectr..

[16]  Francisco Ballestín,et al.  A hybrid genetic algorithm for the resource-constrained project scheduling problem , 2008, Eur. J. Oper. Res..

[17]  Mauricio G. C. Resende,et al.  A genetic algorithm for the resource constrained multi-project scheduling problem , 2008, Eur. J. Oper. Res..

[18]  Rainer Kolisch,et al.  Ablaufplanung für die Leitstrukturoptimierung in der Pharmaforschung , 2003 .

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Erik Demeulemeester,et al.  The discrete time/resource trade-off problem in project networks: a branch-and-bound approach , 2000 .

[21]  Jürgen Zimmermann,et al.  Scheduling tests in automotive R&D projects , 2009, Eur. J. Oper. Res..

[22]  Jan Karel Lenstra,et al.  Parallel machine scheduling: processing rates dependent on number of jobs in operation , 1987 .

[23]  Mohammad Ranjbar,et al.  A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling , 2009, Eur. J. Oper. Res..

[24]  Rainer Kolisch,et al.  Benchmark instances for project scheduling problems , 1999 .

[25]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[26]  András Kovács,et al.  A Novel Approach to Aggregate Scheduling in Project-Oriented Manufacturing , 2003 .

[27]  Robert C. Leachman,et al.  An aggregate model of project-oriented production , 1989, IEEE Trans. Syst. Man Cybern..

[28]  Konrad Meyer.  Wertorientiertes Projektmanagement in der Pharmaforschung , 2003 .

[29]  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..

[30]  Tamás Kis,et al.  A branch-and-cut algorithm for scheduling of projects with variable-intensity activities , 2005, Math. Program..

[31]  Salah E. Elmaghraby,et al.  Activity networks: Project planning and control by network models , 1977 .

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

[33]  Rainer Kolisch.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[34]  Rainer Kolisch,et al.  Efficient priority rules for the resource-constrained project scheduling problem , 1996 .

[35]  Jan Węglarz,et al.  On a methodology for discrete-continuous scheduling , 1998, Eur. J. Oper. Res..

[36]  Erik Demeulemeester,et al.  A classification scheme for project scheduling , 1999 .

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

[38]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .