An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs

Four integer programming formulations are studied for the irregular costs project scheduling problem with time/cost trade-offs (PSIC). Three formulations using standard assignment type variables are tested against a more novel integer programming formulation. Empirical tests show that in many instances the new formulation performs best and can solve problems with up to 90 activities in a reasonable amount of time. This is explained by a reduced number of binary variables, a tighter linear programming (LP) relaxation, and the sparsity and embedded network structure of the constraint matrix of the new formulation.

[1]  Dorit S. Hochbaum.  50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today , 2004, Manag. Sci..

[2]  Rolf H. Möhring,et al.  Solving Project Scheduling Problems by Minimum Cut Computations , 2002, Manag. Sci..

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

[4]  Erik Demeulemeester,et al.  Discrete time/cost trade-offs in project scheduling with time-switch constraints , 2002, J. Oper. Res. Soc..

[5]  S. S. Erenguc,et al.  The resource constrained time/cost tradeoff project scheduling problem with discounted cash flows , 1996 .

[6]  Gerhard J. Woeginger,et al.  Project scheduling with irregular costs: complexity, approximability, and algorithms , 2004, Acta Informatica.

[7]  Joseph G. Szmerekovsky.  The Impact of Contractor Behavior on the Client's Payment-Scheduling Problem , 2005, Manag. Sci..

[8]  Matthew J. Liberatore,et al.  Incorporating Quality Considerations Into Project Time/Cost Tradeoff Analysis and Decision Making , 2006, IEEE Transactions on Engineering Management.

[9]  Erik Demeulemeester,et al.  Maximizing the net present value of a project with linear time-dependent cash flows , 2001 .

[10]  Erik Demeulemeester,et al.  Project network models with discounted cash flows a guided tour through recent developments , 1997, Eur. J. Oper. Res..

[11]  I-Tung Yang,et al.  Impact of budget uncertainty on project time-cost tradeoff , 2005, IEEE Transactions on Engineering Management.

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

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

[14]  Gündüz Ulusoy,et al.  An equitable approach to the payment scheduling problem in project management , 2000, Eur. J. Oper. Res..

[15]  Rema Padman,et al.  Project Contracts and Payment Schedules: The Client's Problem , 2001, Manag. Sci..

[16]  S. Selcuk Erenguc,et al.  Project Scheduling Problems: A Survey , 1993 .

[17]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[18]  Rolf H. Möhring,et al.  On project scheduling with irregular starting time costs , 2001, Oper. Res. Lett..

[19]  Mario Vanhoucke.  New computational results for the discrete time/cost trade-off problem with time-switch constraints , 2005 .

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

[21]  L Sunde,et al.  Net-present-value cost/time tradeoff , 1995 .

[22]  S. S. Erenguc,et al.  Solving time/cost trade‐off problems with discounted cash flows using generalized benders decomposition , 1993 .

[23]  A. H. Russell.  Cash Flows in Networks , 1970 .

[24]  R. Etgar,et al.  Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows , 1999 .

[25]  Gündüz Ulusoy,et al.  Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows , 2001, Ann. Oper. Res..

[26]  Joseph G. Szmerekovsky,et al.  Maximizing project cash availability , 2006 .

[27]  Kathryn A. Marold,et al.  A Simulation Approach to the PERT/CPM Time-Cost Trade-Off Problem , 2004 .

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

[29]  A. Shtub,et al.  A branch and bound algorithm for scheduling projects to maximize net present value: The case of time dependent, contingent cash flows , 1997 .

[30]  Amir Azaron,et al.  Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach , 2007, Eur. J. Oper. Res..