The Project Scheduling Game (PSG): Simulating Time/Cost Trade-Offs in Projects

The Project Scheduling Game is an IT-supported simulation game that illustrates the complexity of scheduling a real-life project. The project is based on a sequence of activities for a large real-life project at the Vlaamse Maatschappij voor Watervoorziening, which aims at the expansion of the capacity to produce purified water. The basic problem type that we use in the game has been described in the literature as a CPM (critical path method) network problem, and focuses on the time/cost relationship in each activity of the project. Indeed, by allocating resources to a particular activity, the manager decides about the duration and corresponding cost of each network activity. The manager schedules the project with the negotiated project deadline in mind, focusing on the minimization of the total project cost.

[1]  J. Horowitz,et al.  Critical Path Problems with Concave Cost-Time Curves , 1972 .

[2]  R. E. Cooke-Yarborough,et al.  Critical Path Planning and Scheduling: An Introduction and Example , 1964 .

[3]  K. Kapur.  An Algorithm for Project Cost-Duration Analysis Problem with Quadratic and Convex Cost Functions , 1973 .

[4]  Carl W. Gooding,et al.  Reducing project duration at minimum cost: A time-cost tradeoff algorithm , 1975 .

[5]  R. R. Hocking,et al.  Optimum Time Compression in Project Scheduling , 1970 .

[6]  S. K. Goyal.  Note---A Note on “A Simple CPM Time-Cost Tradeoff Algorithm” , 1975 .

[7]  Erik Demeulemeester,et al.  The Application of Project Scheduling Techniques in a Real-Life Environment , 2003 .

[8]  Wallace B. S. Crowston,et al.  Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of Projects , 1967, Oper. Res..

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

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

[11]  Erik Demeulemeester,et al.  New computational results on the discrete time/cost trade-off problem in project networks , 1998, J. Oper. Res. Soc..

[12]  Stein W. Wallace,et al.  Improving project cost estimation by taking into account managerial flexibility , 2000, Eur. J. Oper. Res..

[13]  Nicolai Siemens.  A Simple CPM Time-Cost Tradeoff Algorithm , 1971 .

[14]  James E. Kelley,et al.  Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .

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

[16]  D. R. Robinson.  A Dynamic Programming Solution to Cost-Time Tradeoff for CPM , 1975 .

[17]  Martin Skutella,et al.  Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem , 1997, Math. Oper. Res..

[18]  E. W. Davis,et al.  Project Management With Cpm, Pert and Precedence Diagramming , 1983 .

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

[20]  Can Akkan,et al.  Network Decomposition for the Discrete Time-Cost Tradeoff Problem - Part 1: Models and Bounding Methods. , 2000 .

[21]  D. R. Fulkerson.  A Network Flow Computation for Project Cost Curves , 1961 .

[23]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[24]  S. Elmaghraby,et al.  The Analysis of Activity Networks Under Generalized Precedence Relations GPRs , 1992 .

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

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

[27]  Salah E. Elmaghraby,et al.  DAGEN: A Generator of Testsets for Project Activity Nets; Working Paper , 1994 .

[28]  Gündüz Ulusoy,et al.  A survey on the resource-constrained project scheduling problem , 1995 .

[29]  Erik Demeulemeester,et al.  A Random Activity Network Generator , 1993, Oper. Res..

[30]  Salah E. Elmaghraby,et al.  Activity nets: A guided tour through some recent developments , 1995 .

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

[32]  Robert Klein,et al.  Scheduling of Resource-Constrained Projects , 1999 .

[33]  J. D. Wiest,et al.  A management guide to PERT/CPM: With GERT/PDM/DCPM and other networks , 1977 .

[34]  Erik Demeulemeester,et al.  RanGen: A Random Network Generator for Activity-on-the-Node Networks , 2003, J. Sched..

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

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

[37]  Erik Demeulemeester,et al.  Optimal procedures for the discrete time/cost trade-off problem in project networks , 1996 .

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