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.
AgrawalM.K., ElmaghrabyS.E., & HerroelenW.S. (1996). DAGEN: A generator of test sets for project activity nets. European Journal of Operational Research, 90, 376–382.
2.
AkkanC., DrexlA., & KimmsA. (2000a). Network decomposition for the discrete time/cost trade-off problem – Part 1: Models and bounding methods. Extended abstracts of the Seventh International Workshop on Project Management and Scheduling. Osnabrúck, Germany, April 17-19, 29–31.
3.
AkkanC., DrexlA., & KimmsA. (2000b). Network decomposition for the discrete time/cost trade-off problem – Part 2: Network decomposition and computational results. Extended abstracts of the Seventh International Workshop on Project Management and Scheduling. Osnabrúck, Germany, April 17-19, 32–34.
4.
BiancoL., & SperanzaM.G. (1990). Resource management in project scheduling. Proceedings of the Second International Workshop on Project Management and Scheduling. June 20-22, Compiègne, France.
BruckerP., DrexlA., MöhringR., NeumannK., & PeschE. (1999). Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 112, 3–41.
7.
CrowstonW. (1970). Network reduction and solution. Operations Research Quarterly, 21, 435–450.
8.
CrowstonW., & ThompsonG.L. (1967). Decision CPM: A method for simultaneous planning, scheduling and control of projects. Operations Research, 15, 407–426.
9.
DeP., DunneE.J., GhoshJ.B., & WellsC.E. (1995). The discrete time/cost trade-off problem revisited. European Journal of Operational Research, 81, 225–238.
10.
DeP., DunneE.J., GhoshJ.B., & WellsC.E. (1997). Complexity of the discrete time/cost trade-off problem for project networks. Operations Research, 45, 302–306.
11.
DemeulemeesterE., De ReyckB., FoubertB., HerroelenW., & VanhouckeM. (1998). New computational results for the discrete time/cost trade-off problem in project networks. Journal of the Operational Research Society, 49, 1153–1163.
12.
DemeulemeesterE., DodinB., & HerroelenW. (1993). A random activity network generator. Operations Research, 41, 972–980.
13.
DemeulemeesterE., ElmaghrabyS.E., & HerroelenW. (1996). Optimal procedures for the discrete time/cost trade-off problem in project networks. European Journal of Operational Research, 88, 50–68.
14.
DemeulemeesterE., & HerroelenW. (2002). Project scheduling: A research handbook.Kluwer International Series in Operations Research and Management Science, Boston: Kluwer Academic Publishers.
15.
DemeulemeesterE., VanhouckeM., & HerroelenW. (2003). A random network generator for activity-on-the-node networks. Journal of Scheduling, 6, 13–34.
16.
ElmaghrabyS.E. (1995). Activity nets: A guided tour through some recent developments. European Journal of Operational Research, 82, 383–408.
17.
ElmaghrabyS.E., & KamburowskiJ. (1992). The analysis of activity networks under generalized precedence relations. Management Science, 38, 1245–1263.
18.
ElmaghrabyS.E., & SalemA. (1980a). Optimal project compression under convex cost functions I: Quadratic cost with continuous derivative (OR Technical Report 158). Raleigh, NC: North Carolina State University.
19.
ElmaghrabyS.E., & SalemA. (1980b). Optimal project compression under convex cost functions II (OR Technical Report 157). Raleigh, NC: North Carolina State University.
20.
ElmaghrabyS.E., & SalemA. (1981). Optimal linear approximation in project compression (OR Technical Report 171). Raleigh, NC: North Carolina State University.
FordL.R., & FulkersonD.R. (1962). Flows in networks.Princeton, NJ: Princeton University Press.
23.
FulkersonD.R. (1961). A network flow computation for project cost curves. Management Science, 7, 167–178.
24.
GoyalS.K. (1975). A note on the paper: A simple CPM time/cost trade-off algorithm. Management Science, 21, 718–722.
25.
HerroelenW., De ReyckB., & DemeulemeesterE. (1998). Resource-constrained project scheduling: A survey of recent developments. Computers and Operations Research, 25, 279–302.
26.
HindelangT.J., & MuthJ.F. (1979). A dynamic programming algorithm for decision CPM networks. Operations Research, 27, 225–241.
27.
IcmeliO., ErengúçS.S., & ZappeC.J. (1993). Project scheduling problems: A survey. International Journal of Operations andProduction Management, 13, 80–91.
28.
JorgensenT., & WallaceS.W. (2000). Improving project cost estimation by taking into account managerial flexibility. European Journal of Operational Research, 127, 239–251.
29.
KapurK.C. (1973). An algorithm for the project cost/duration analysis problem with quadratic and convex cost functions. IIE Transactions, 5, 314–322.
KelleyJ.E., & WalkerM.R. (1959). Critical path planning and scheduling: An introduction.Ambler, PA: Mauchly Associates.
32.
KleinR. (2000). Scheduling of resource-constrained projects.Boston, MA: Kluwer Academic Publishers.
33.
KolischR., SprecherA., & DrexlA. (1995). Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 41, 1693–1703.
34.
LambersonL.R., & HockingR.R. (1970). Optimum time compression in project scheduling. Management Science, 16, B597–B606.
35.
ModerJ.J., PhillipsC.R., & DavisE.W. (1983). Project management with CPM, PERT and precedence diagramming (3rd ed.). New York: Van Nostrand Reinhold Company.
36.
ÖzdamarL., & UlusoyG. (1995). A survey on the resource-constrained project scheduling problem. IIE Transactions, 27, 574–586.
37.
PattersonJ.H., & HarveyR.T. (1979). An implicit enumeration algorithm for the time/cost trade-off problem in project network analysis. Foundations of Control Engineering, 6, 107–117.
38.
RobinsonD.R. (1975). A dynamic programming solution to cost/time trade-off for CPM. Management Science, 22, 158–166.
39.
SchwindtC. (1995). A new problem generator for different resource-constrained project scheduling problems with minimal and maximal time lags (WIOR-Report-449). Karlsruhe, Germany: University of Karlsruhe, Institut fúr Wirtschaftstheorie und Operations Research.
SiemensN., & GoodingC. (1975). Reducing project duration at minimum cost: A time/cost trade-off algorithm. OMEGA, 3, 569–581.
42.
SkutellaM. (1998). Approximation algorithms for the discrete time-cost tradeoff problem. Mathematics of Operations Research, 23, 909–929.
43.
VanhouckeM. (in press). New computational results for the discrete time/cost trade-off problem with time-switch constraints. European Journal of Operational Research.
44.
VanhouckeM., DemeulemeesterE., & HerroelenW. (2002). Discrete time/cost trade-offs in project scheduling with time-switch constraints. Journal of the Operational Research Society, 53, 1–11.
45.
VanhouckeM., & DemeulemeesterE. (2003). The application of project scheduling techniques in a real-life environment. Project Management Journal, 34(1), 30–42.
46.
VercellisC. (1990). Multi-project scheduling with time-resource-cost trade-offs: A tactical model. Proceedings of the Second International Workshop on Project Management and Scheduling, June 20-22, Compiègne, France.
47.
WalkerM.R., & SayerJ.S. (1959). Project planning and scheduling (Report 6959). Wilmington, DE: E.I. duPont de Nemours and Co.
48.
WiestJ.D., & LevyF.K. (1977). A management guide to PERT/CPM: With GERT/PDM/DCPM and other networks.New Delhi, India: Prentice-Hall, Inc.
