An integrated scheduling and control model for multi-mode projects

In today’s highly competitive uncertain project environments, it is of crucial importance to develop analytical models and algorithms to schedule and control project activities so that the deviations from the project objectives are minimized. This paper addresses the integrated scheduling and control in multi-mode project environments. We propose an optimization model that models the dynamic behavior of projects and integrates optimal control into a practically relevant project scheduling problem. From the scheduling perspective, we address the discrete time/cost trade-off problem, whereas an optimal control formulation is used to capture the effect of project control. Moreover, we develop a solution algorithm for two particular instances of the optimal project control. This algorithm combines a tabu search strategy and nonlinear programming. It is applied to a large scale test bed and its efficiency is tested by means of computational experiments. To the best of our knowledge, this research is the first application of optimal control theory to multi-mode project networks. The models and algorithms developed in this research are targeted as a support tool for project managers in both scheduling and deciding on the timing and quantity of control activities.

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

[2]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[3]  Willy Herroelen,et al.  Project scheduling under uncertainty: Survey and research potentials , 2005, Eur. J. Oper. Res..

[4]  David W. Coit,et al.  Exploiting Tabu Search Memory in Constrained Problems , 2004, INFORMS J. Comput..

[5]  Jonathan Burton,et al.  Timing of monitoring and control of CPM projects , 1993 .

[6]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[7]  Konstantin Kogan,et al.  Optimal control in homogeneous projects: analytically solvable deterministic cases , 2002 .

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

[9]  Luca Maria Gambardella,et al.  Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..

[10]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .

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

[12]  Jan Węglarz,et al.  Project Scheduling with Continuously-Divisible, Doubly Constrained Resources , 1981 .

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

[14]  Jorge Nocedal,et al.  Knitro: An Integrated Package for Nonlinear Optimization , 2006 .

[15]  G. Thompson,et al.  Optimal Control Theory: Applications to Management Science and Economics , 2000 .

[16]  Tzvi Raz,et al.  Optimal timing of project control points , 2000, Eur. J. Oper. Res..

[17]  R. Macchiaroli,et al.  Timing of control activities in project planning , 1998 .

[18]  Eugeniusz Nowicki,et al.  Optimal control policies for resource allocation in an activity network , 1984 .

[19]  Prabuddha De,et al.  The discrete time-cost tradeoff problem revisited , 1995 .

[20]  Erdal Erel,et al.  Robust optimization models for the discrete time/cost trade-off problem , 2011 .

[21]  Prabuddha De,et al.  Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks , 1997, Oper. Res..

[22]  M. Roma,et al.  Large-Scale Nonlinear Optimization , 2006 .