全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

An Overview of Recent Research Results and Future Research Avenues Using Simulation Studies in Project Management

DOI: 10.1155/2013/513549

Full-Text   Cite this paper   Add to My Lib

Abstract:

This paper gives an overview of three simulation studies in dynamic project scheduling integrating baseline scheduling with risk analysis and project control. This integration is known in the literature as dynamic scheduling. An integrated project control method is presented using a project control simulation approach that combines the three topics into a single decision support system. The method makes use of Monte Carlo simulations and connects schedule risk analysis (SRA) with earned value management (EVM). A corrective action mechanism is added to the simulation model to measure the efficiency of two alternative project control methods. At the end of the paper, a summary of recent and state-of-the-art results is given, and directions for future research based on a new research study are presented. 1. Introduction Completing a project on time and within budget is not an easy task. Monitoring and controlling projects consists of processes to observe project progress in such a way that potential problems can be identified in a timely manner and corrective actions can be taken, when necessary, to bring endangered projects back on track. The key benefit is that project performance is observed and measured regularly to identify variances from the project baseline schedule. Therefore, monitoring the progress and performance of projects in progress using integrated project control systems requires a set of tools and techniques that should ideally be integrated into a single decision support system. In this paper, such a system is used in a simulation study using the principles of dynamic scheduling [1–3]. The term dynamic scheduling is used to refer to an integrative project control approach using three main dimensions which can be briefly outlined along the following lines. (i)Baseline scheduling is necessary to construct a timetable that provides a start and finish date for each project activity, taking activity relations, resource constraints, and other project characteristics into account and aiming to reach a certain scheduling objective. (ii)Risk analysis is crucial to analyse the strengths and weaknesses of the project baseline schedule in order to obtain information about the schedule sensitivity and the impact of potential changes that undoubtedly occur during project progress. (iii)Project control is essential to measure the (time and cost) performance of a project during its progress and to use the information obtained during the scheduling and risk analysis steps to monitor and update the project and to take corrective actions in case of

References

[1]  E. Uyttewaal, Dynamic Scheduling with Microsoft Office Project 2003: The Book by and for Professionals, International Institute for Learning, 2005.
[2]  M. Vanhoucke, Project Management with Dynamic Scheduling: Baseline Scheduling, Risk Analysis and Project Control, vol. 18, Springer, 2012.
[3]  M. Vanhoucke, “Dynamic scheduling: integrating schedule risk analysis with earned value management,” The Measurable News, vol. 2, pp. 11–13, 2012.
[4]  M. Vanhoucke, “Measuring time using novel earned value management metrics,” in Proceedings of the 22nd IPMA World Congress, vol. 1, pp. 99–103, Rome, Italy, November 2008.
[5]  J. Kelley and M. Walker, Critical Path Planning and Scheduling: An Introduction, Mauchly Associates, Ambler, Pa, USA, 1959.
[6]  M. Walker and J. Sawyer, “Project planning and scheduling,” Tech. Rep. 6959, E. I. du Pont de Nemours and Company, Wilmington, Del, USA, 1959.
[7]  J. Kelley, “Critical path planning and scheduling: mathematical basis,” Operations Research, vol. 9, pp. 296–320, 1961.
[8]  O. Icmeli, S. Erengü?, and C. Zappe, “Project scheduling problems: a survey,” International Journal of Operations & Production Management, vol. 13, pp. 80–91, 1993.
[9]  S. Elmaghraby, “Activity nets: a guided tour through some recent developments,” European Journal of Operational Research, vol. 82, no. 3, pp. 383–408, 1995.
[10]  L. ?zdamar and G. Ulusoy, “A survey on the resource-constrained project scheduling problem,” IIE Transactions, vol. 27, no. 5, pp. 574–586, 1995.
[11]  W. Herroelen, B. De Reyck, and E. Demeulemeester, “Resource-constrained project scheduling: a survey of recent developments,” Computers & Operations Research, vol. 25, no. 4, pp. 279–302, 1998.
[12]  P. Brucker, A. Drexl, R. M?hring, K. Neumann, and E. Pesch, “Resource-constrained project scheduling: notation, classification, models, and methods,” European Journal of Operational Research, vol. 112, no. 1, pp. 3–41, 1999.
[13]  E. Demeulemeester and W. Herroelen, Project Scheduling: A Research Handbook, Kluwer Academic, 2002.
[14]  W. Herroelen, E. Demeulemeester, and B. De Reyck, “A classification scheme for project scheduling problems,” in Project Scheduling—Recent Models, Algorithms and Applications, J. Weglarz, Ed., pp. 1–26, Kluwer Academic, Dortrecht, The Netherlands, 1999.
[15]  E. Demeulemeester, “Minimizing resource availability costs in time-limited project networks,” Management Science, vol. 41, pp. 1590–1598, 1995.
[16]  A. Drexl and A. Kimms, “Optimization guided lower and upper bounds for the resource investment problem,” Journal of the Operational Research Society, vol. 52, no. 3, pp. 340–351, 2001.
[17]  C.-C. Hsu and D. Kim, “A new heuristic for the multi-mode resource investment problem,” Journal of the Operational Research Society, vol. 56, no. 4, pp. 406–413, 2005.
[18]  S. Shadrokh and F. Kianfar, “A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty,” European Journal of Operational Research, vol. 181, no. 1, pp. 86–101, 2007.
[19]  D. Yamashita, V. Armentano, and M. Laguna, “Scatter search for project scheduling with resource availability cost,” European Journal of Operational Research, vol. 169, no. 2, pp. 623–637, 2006.
[20]  T. Gather, J. Zimmermann, and J.-H. Bartels, “Tree-based methods for resource investment and resource leveling problems,” in Proceedings of the 11th International Workshop on Project Management and Scheduling (PMS '08), pp. 94–98, Istanbul, Turkey, 2008.
[21]  M. Shahsavar, S. T. A. Niaki, and A. A. Najafi, “An efficient genetic algorithm to maximize net present value of project payments under inflation and bonus-penalty policy in resource investment problem,” Advances in Engineering Software, vol. 41, no. 7-8, pp. 1023–1030, 2010.
[22]  M. Bandelloni, M. Tucci, and R. Rinaldi, “Optimal resource leveling using non-serial dyanamic programming,” Project Managing and Scheduling, vol. 78, no. 2, pp. 162–177, 1994.
[23]  K. Neumann and J. Zimmermann, “Resource levelling for projects with schedule-dependent time windows,” European Journal of Operational Research, vol. 117, no. 3, pp. 591–605, 1999.
[24]  K. Neumann and J. Zimmermann, “Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints,” European Journal of Operational Research, vol. 127, no. 2, pp. 425–443, 2000.
[25]  E. Coughlan, M. Lübbecke, and J. Schulz, “A branch-and-price algorithm for multi-mode resource leveling,” in A Branch-and-Price Algorithm for Multi-mode Resource Leveling, P. Festa, Ed., vol. 6049 of Lecture Notes in Computer Science, pp. 226–238, Springer, Berlin, Germany, 2010.
[26]  T. Gather, J. Zimmermann, and J.-H. Bartels, “Exact methods for the resource leveling problem,” Journal of Scheduling, vol. 14, no. 6, pp. 557–569, 2011.
[27]  K. El-Rayes and O. Moselhi, “Resource-driven scheduling of repetitive activities,” Construction Management and Economics, vol. 16, no. 4, pp. 433–446, 1998.
[28]  M. Vanhoucke, “Work continuity constraints in project scheduling,” Journal of Construction Engineering and Management, vol. 132, no. 1, pp. 14–25, 2006.
[29]  M. Vanhoucke, “Work continuity optimization for the Westerscheldetunnel project in the Netherlands,” Tijdschrift voor Economie en Management, vol. 52, pp. 435–449, 2007.
[30]  H. Nübel, “The resource renting problem subject to temporal constraints,” OR Spektrum, vol. 23, no. 3, pp. 359–381, 2001.
[31]  F. Ballestín, “A genetic algorithm for the resource renting problem with minimum and maximum time lags,” in Evolutionary Computation in Combinatorial Optimization, vol. 4446 of Lecture Notes in Computer Science, pp. 25–35, Springer, Berlin, Germany, 2007.
[32]  F. Ballestín, “Different codifications and metaheuristic algorithms for the resource renting problem with minimum and maximum time lags,” in Recent Advances in Evolutionary Computation for Combinatorial Intelligence, C. Cotta and J. van Hemert, Eds., vol. 153 of Studies in Computational Intelligence, chapter 12, pp. 187–202, Springer, Berlin, Germany, 2008.
[33]  L. Vandenheede and M. Vanhoucke, “A scatter search algorithm for the resource renting problem,” Working Paper, Ghent University, 2013.
[34]  D. Smith-Daniels and N. Aquilano, “Using a late-start resource-constrained project schedule to improve project net present value,” Decision Sciences, vol. 18, pp. 617–630, 1987.
[35]  S. Elmaghraby and W. Herroelen, “The scheduling of activities to maximize the net present value of projects,” European Journal of Operational Research, vol. 49, no. 1, pp. 35–49, 1990.
[36]  K. Yang, F. Talbot, and J. Patterson, “Scheduling a project to maximize its net present value: an integer programming approach,” European Journal of Operational Research, vol. 64, no. 2, pp. 188–198, 1993.
[37]  C. Sepil, “Comment on Elmaghraby and Herroelen's ‘the scheduling of activities to maximize the net present value of projects’,” European Journal of Operational Research, vol. 73, no. 1, pp. 185–187, 1994.
[38]  K. Yang, L. Tay, and C. Sum, “A comparison of stochastic scheduling rules for maximizing project net present value,” European Journal of Operational Research, vol. 85, no. 2, pp. 327–339, 1995.
[39]  S. Baroum and J. Patterson, “The development of cash flow weight procedures for maximizing the net present value of a project,” Journal of Operations Management, vol. 14, no. 3, pp. 209–227, 1996.
[40]  O. Icmeli and S. S. Erengü?, “The resource constrained time/cost tradeoff project scheduling problem with discounted cash flows,” Journal of Operations Management, vol. 14, no. 3, pp. 255–275, 1996.
[41]  J. Pinder and A. Marucheck, “Using discounted cash flow heuristics to improve project net present value,” Journal of Operations Management, vol. 14, no. 3, pp. 229–240, 1996.
[42]  A. Shtub and R. Etgar, “A branch and bound algorithm for scheduling projects to maximize net present value: the case of time dependent, contingent cash flows,” International Journal of Production Research, vol. 35, no. 12, pp. 3367–3378, 1997.
[43]  L. ?zdamar, G. Ulusoy, and M. Bayyigit, “A heuristic treatment of tardiness and net present value criteria in resource constrained project scheduling,” International Journal of Physical Distribution & Logistics Management, vol. 28, pp. 805–824, 1998.
[44]  R. Etgar, A. Shtub, and L. Leblanc, “Scheduling projects to maximize net present value—the case of time-dependent, contingent cash flows,” European Journal of Operational Research, vol. 96, no. 1, pp. 90–96, 1997.
[45]  R. Etgar and A. Shtub, “Scheduling project activities to maximize the net present value—the case of linear time-dependent cash flows,” International Journal of Production Research, vol. 37, no. 2, pp. 329–339, 1999.
[46]  E. Goto, T. Joko, K. Fujisawa, N. Katoh, and S. Furusaka, “Maximizing net present value for generalized resource constrained project scheduling problem,” Working Paper, Nomura Research Institute, Kyoto, Japan, 2000.
[47]  A. Kimms, “Maximizing the net present value of a project under resource constraints using a lagrangian relaxation based heuristic with tight upper bounds,” Annals of Operations Research, vol. 102, no. 1–4, pp. 221–236, 2001.
[48]  C. Schwindt and J. Zimmermann, “A steepest ascent approach to maximizing the net present value of projects,” Mathematical Methods of Operations Research, vol. 53, no. 3, pp. 435–450, 2001.
[49]  M. Vanhoucke, E. Demeulemeester, and W. Herroelen, “Maximizing the net present value of a project with linear time-dependent cash flows,” International Journal of Production Research, vol. 39, no. 14, pp. 3159–3181, 2001.
[50]  M. Vanhoucke, E. Demeulemeester, and W. Herroelen, “On maximizing the net present value of a project under renewable resource constraints,” Management Science, vol. 47, no. 8, pp. 1113–1121, 2001.
[51]  T. Selle and J. Zimmermann, “A bidirectional heuristic for maximizing the net present value of large-scale projects subject to limited resources,” Naval Research Logistics, vol. 50, no. 2, pp. 130–148, 2003.
[52]  M. Vanhoucke, E. Demeulemeester, and W. Herroelen, “Progress payments in project scheduling problems,” European Journal of Operational Research, vol. 148, no. 3, pp. 604–620, 2003.
[53]  M. Vanhoucke, “A genetic algorithm for net present value maximization for resource constrained projects,” in Evolutionary Computation in Combinatorial Optimization, vol. 5482 of Lecture Notes in Computer Science, pp. 13–24, Springer, Berlin, Germany, 2009.
[54]  M. Vanhoucke, “A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows,” International Journal of Production Research, vol. 48, no. 7, pp. 1983–2001, 2010.
[55]  M. Mika, G. Waligóra, and J. We?glarz, “Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models,” European Journal of Operational Research, vol. 164, no. 3, pp. 639–668, 2005.
[56]  M. Vanhoucke and E. Demeulemeester, “The application of project scheduling techniques in a real-life environment,” Project Management Journal, vol. 34, pp. 30–42, 2003.
[57]  C. Schwindt, “Minimizing earliness-tardiness costs of resource-constrained projects,” in Operations Research Proceedings 1999, Selected Papers of the Symposium on Operations Research (SOR '99), Magdeburg, Germany, September, 1999, pp. 402–408, Springer, 2000.
[58]  M. Vanhoucke, E. Demeulemeester, and W. Herroelen, “An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem,” Annals of Operations Research, vol. 102, no. 1–4, pp. 179–196, 2001.
[59]  M. Vanhoucke, “Scheduling an R&D project with quality-dependent time slots,” in Computational Science and Its Applications, vol. 3982 of Lecture Notes in Computer Science, pp. 621–630, Springer, Berlin, Germany, 2006.
[60]  R. Kolisch and S. Hartmann, “Experimental investigation of heuristics for resource-constrained project scheduling: an update,” European Journal of Operational Research, vol. 174, no. 1, pp. 23–37, 2006.
[61]  C. Delisle and D. Olson, “Would the real project management language please stand up?” International Journal of Project Management, vol. 22, no. 4, pp. 327–337, 2004.
[62]  S. Hartmann and D. Briskorn, “A survey of variants and extensions of the resource-constrained project scheduling problem,” European Journal of Operational Research, vol. 207, no. 1, pp. 1–15, 2010.
[63]  M. Vanhoucke, Measuring Time—Improving Project Performance Using Earned Value Management, vol. 136 of International Series in Operations Research and Management Science, Springer, 2010.
[64]  M. Vanhoucke, “On the dynamic use of project performance and schedule risk information during project tracking,” Omega, vol. 39, no. 4, pp. 416–426, 2011.
[65]  A. Klingel, “Bias in PERT project completion time calculations for a real network,” Management Science, vol. 13, pp. B194–B201, 1966.
[66]  R. Schonberger, “Why projects are “always” late: a rationale based on manual simulation of a PERT/CPM network,” Interfaces, vol. 11, pp. 65–70, 1981.
[67]  G. Gutierrez and P. Kouvelis, “Parkinson's law and its implications for project management,” Management Science, vol. 37, no. 8, pp. 990–1001, 1991.
[68]  D. Malcolm, J. Roseboom, C. Clark, and W. Fazar, “Application of a technique for a research and development program evaluation,” Operations Research, vol. 7, pp. 646–669, 1959.
[69]  S. AbouRizk, D. Halpin, and J. Wilson, “Fitting beta distributions based on sample data,” Journal of Construction Engineering and Management, vol. 120, no. 2, pp. 288–305, 1994.
[70]  T. Williams, “Critically in stochastic networks,” Journal of the Operational Research Society, vol. 43, no. 4, pp. 353–357, 1992.
[71]  D. Johnson, “The triangular distribution as a proxy for the beta distribution in risk analysis,” Journal of the Royal Statistical Society D, vol. 46, no. 3, pp. 387–398, 1997.
[72]  M. E. Kuhl, E. K. Lada, N. M. Steiger, M. A. Wagner, and J. R. Wilson, “Introduction to modeling and generating probabilistic input processes for simulation,” in Proceedings of the Winter Simulation Conference, S. Henderson, B. Biller, M. Hsieh, J. Shortle, J. Tew, and R. Barton, Eds., pp. 63–76, Institute of Electrical and Electronics Engineers, New Jersey, NJ, USA, 2007.
[73]  M. Vanhoucke, “Using activity sensitivity and network topology information to monitor project time performance,” Omega, vol. 38, no. 5, pp. 359–370, 2010.
[74]  D. Trietsch, L. Mazmanyan, L. Gevorgyan, and K. R. Baker, “Modeling activity times by the Parkinson distribution with a lognormal core: theory and validation,” European Journal of Operational Research, vol. 216, no. 2, pp. 386–396, 2012.
[75]  T. Williams, “Towards realism in network simulation,” Omega, vol. 27, no. 3, pp. 305–314, 1999.
[76]  S. Elmaghraby and W. Herroelen, “On the measurement of complexity in activity networks,” European Journal of Operational Research, vol. 5, pp. 223–234, 1980.
[77]  M. Vanhoucke, J. Coelho, D. Debels, B. Maenhout, and L. Tavares, “An evaluation of the adequacy of project network generators with systematically sampled networks,” European Journal of Operational Research, vol. 187, no. 2, pp. 511–524, 2008.
[78]  J. Patterson, “Project scheduling: the effects of problem structure on heuristic performance,” Naval Research Logistics, vol. 23, no. 1, pp. 95–123, 1976.
[79]  L. Tavares, J. Ferreira, and J. Coelho, “The risk of delay of a project in terms of the morphology of its network,” European Journal of Operational Research, vol. 119, no. 2, pp. 510–537, 1999.
[80]  L. Tavares, J. Ferreira, and J. Coelho, “A surrogate indicator of criticality for stochastic networks,” International Transactions in Operational Research, vol. 11, pp. 193–202, 2004.
[81]  E. Demeulemeester, B. Dodin, and W. Herroelen, “A random activity network generator,” Operations Research, vol. 41, no. 5, pp. 972–980, 1993.
[82]  R. Kolisch, A. Sprecher, and A. Drexl, “Characterization and generation of a general class of resource-constrained project scheduling problems,” Management Science, vol. 41, pp. 1693–1703, 1995.
[83]  C. Schwindt, “A new problem generator for different resource-constrained project scheduling problems with minimal and maximal time lags,” WIOR-Report 449, Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe, 1995.
[84]  M. Agrawal, S. Elmaghraby, and W. S. Herroelen, “DAGEN: a generator of testsets for project activity nets,” European Journal of Operational Research, vol. 90, no. 2, pp. 376–382, 1996.
[85]  L. Tavares, Advanced Models for Project Management, Kluwer Academic, Dordrecht, The Netherlands, 1999.
[86]  A. Drexl, R. Nissen, J. H. Patterson, and F. Salewski, “ProGen/πχ—an instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions,” European Journal of Operational Research, vol. 125, no. 1, pp. 59–72, 2000.
[87]  E. Demeulemeester, M. Vanhoucke, and W. Herroelen, “Rangen: a random network generator for activity-on-the-node networks,” Journal of Scheduling, vol. 6, no. 1, pp. 17–38, 2003.
[88]  C. Akkan, A. Drexl, and A. Kimms, “Network decomposition-based benchmark results for the discrete time-cost tradeoff problem,” European Journal of Operational Research, vol. 165, no. 2, pp. 339–358, 2005.
[89]  T. Pascoe, “Allocation of resources—CPM,” Revue Franqaise de Recherche Operationnelle, vol. 38, pp. 31–38, 1966.
[90]  E. Davies, “An experimental investigation of resource allocation in multiactivity projects,” Operational Research Quarterly, vol. 24, no. 4, pp. 587–591, 1973.
[91]  R. Kaimann, “Coefficient of network complexity,” Management Science, vol. 21, pp. 172–177, 1974.
[92]  R. Kaimann, “Coefficient of network complexity: erratum,” Management Science, vol. 21, pp. 1211–1212, 1975.
[93]  E. Davis, “Project network summary measures constrained-resource scheduling,” AIIE Transactions, vol. 7, no. 2, pp. 132–142, 1975.
[94]  B. De Reyck and W. Herroelen, “On the use of the complexity index as a measure of complexity in activity networks,” European Journal of Operational Research, vol. 91, no. 2, pp. 347–366, 1996.
[95]  W. Herroelen and B. De Reyck, “Phase transitions in project scheduling,” Journal of the Operational Research Society, vol. 50, no. 2, pp. 148–156, 1999.
[96]  R. Alvarez-Valdes and J. Tamarit, “Heuristic algorithms for resource-constrained project scheduling: a review and empirical analysis,” in Advances in Project Scheduling, R. Slowinski and J. Weglarz, Eds., Elsevier, Amsterdam, The Netherlands, 1989.
[97]  A. Mastor, “An experimental and comparative evaluation of production line balancing techniques,” Management Science, vol. 16, pp. 728–746, 1970.
[98]  E. Kao and M. Queyranne, “On dynamic programming methods for assembly line balancing,” Operations Research, vol. 30, pp. 375–390, 1982.
[99]  A. Thesen, “Measures of the restrictiveness of project networks,” Networks, vol. 7, no. 3, pp. 193–208, 1977.
[100]  E. Dar-El, “MALB—a heuristic technique for balancing large single model assembly lines,” AIEE Transactions, vol. 5, no. 4, pp. 343–356, 1973.
[101]  B. De Reyck, “On the use of the restrictiveness as a measure of complexity for resource-constrained project scheduling,” Research Report 9535, Katholieke Universiteit Leuven, Leuven, Belgium, 1995.
[102]  W. Bein, J. Kamburowski, and M. Stallmann, “Optimal reduction of two-terminal directed acyclic graphs,” SIAM Journal on Computing, vol. 21, pp. 1112–1129, 1992.
[103]  L. Ford and D. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, USA, 1962.
[104]  L. Tavares, J. Ferreira, and J. Coelho, “A comparative morphologic analysis of benchmark sets of project networks,” International Journal of Project Management, vol. 20, no. 6, pp. 475–485, 2002.
[105]  S. Elmaghraby, Activity Networks: Project Planning and Control by Network Models, John Wiley & Sons, New York, NY, USA, 1977.
[106]  D. Hulett, “Schedule risk analysis simplified,” Project Management Network, vol. 10, pp. 23–30, 1996.
[107]  D. Kuchta, “Use of fuzzy numbers in project risk (criticality) assessment,” International Journal of Project Management, vol. 19, no. 5, pp. 305–310, 2001.
[108]  S. Elmaghraby, “On criticality and sensitivity in activity networks,” European Journal of Operational Research, vol. 127, no. 2, pp. 220–238, 2000.
[109]  J. Cho and B. Yum, “An uncertainty importance measure of activities in PERT networks,” International Journal of Production Research, vol. 35, no. 10, pp. 2737–2757, 1997.
[110]  S. Elmaghraby, Y. Fathi, and M. Taner, “On the sensitivity of project variability to activity mean duration,” International Journal of Production Economics, vol. 62, no. 3, pp. 219–232, 1999.
[111]  G. Gutierrez and A. Paul, “Analysis of the effects of uncertainty, risk-pooling, and subcontracting mechanisms on project performance,” Operations Research, vol. 48, no. 6, pp. 927–938, 2000.
[112]  M.-J. Yao and W.-M. Chu, “A new approximation algorithm for obtaining the probability distribution function for project completion time,” Computers and Mathematics with Applications, vol. 54, no. 2, pp. 282–295, 2007.
[113]  T. Williams, “A classified bibliography of recent research relating to project risk management,” European Journal of Operational Research, vol. 85, no. 1, pp. 18–38, 1995.
[114]  PMBOK, A Guide to the Project Management Body of Knowledge, Project Management Institute, Newtown Square, Pa, USA, 3rd edition, 2004.
[115]  M. Vanhoucke and S. Vandevoorde, “A simulation and evaluation of earned value metrics to forecast the project duration,” Journal of the Operational Research Society, vol. 58, no. 10, pp. 1361–1374, 2007.
[116]  S. Vandevoorde and M. Vanhoucke, “A comparison of different project duration forecasting methods using earned value metrics,” International Journal of Project Management, vol. 24, no. 4, pp. 289–302, 2006.
[117]  M. Vanhoucke and S. Vandevoorde, “Measuring the accuracy of earned value/earned schedule forecasting predictors,” The Measurable News, pp. 26–30, 2007.
[118]  M. Vanhoucke, “Project tracking and control: can we measure the time?” Projects and Profits, pp. 35–40, 2008.
[119]  M. Vanhoucke and S. Vandevoorde, “Earned value forecast accuracy and activity criticality,” The Measurable News, no. 3, pp. 13–16, 2008.
[120]  M. Vanhoucke and S. Vandevoorde, “Forecasting a project’s duration under various topological structures,” The Measurable News, no. 1, pp. 26–30, 2009.
[121]  M. Vanhoucke, “Measuring time: an earned value performance management study,” The Measurable News, vol. 1, pp. 10–14, 2010.
[122]  M. Vanhoucke, “Measuring the efficiency of project control using fictitious and empirical project data,” International Journal of Project Management, vol. 30, no. 2, pp. 252–263, 2012.
[123]  Q. Fleming and J. Koppelman, Earned Value Project Management, Project Management Institute, Newtown Square, Pa, USA, 3rd edition, 2005.
[124]  Q. Fleming and J. Koppelman, “What's your project's real price tag?” Harvard Business Review, vol. 81, no. 9, pp. 20–21, 2003.
[125]  W. Lipke, “Schedule is different,” The Measurable News, pp. 31–34, 2003.
[126]  F. Anbari, “Earned value project management method and extensions,” Project Management Journal, vol. 34, no. 4, pp. 12–23, 2003.
[127]  D. Jacob, “Forecasting project schedule completion with earned value metrics,” The Measurable News, vol. 1, pp. 7–9, 2003.
[128]  D. Jacob and M. Kane, “Forecasting schedule completion using earned value metrics? Revisited,” The Measurable News, vol. l, pp. 11–17, 2004.
[129]  S. Book, “Correction note: “earned schedule” and its possible unreliability as an indicator,” The Measurable News, pp. 22–24, 2006.
[130]  S. Book, “‘Earned schedule’ and its possible unreliability as an indicator,” The Measurable News, pp. 24–30, 2006.
[131]  D. Jacob, “Is “earned schedule” an unreliable indicator?” The Measurable News, pp. 15–21, 2006.
[132]  W. Lipke, “Applying earned schedule to critical path analysis and more,” The Measurable News, pp. 26–30, 2006.
[133]  W. Lipke, O. Zwikael, K. Henderson, and F. Anbari, “Prediction of project outcome. The application of statistical methods to earned value management and earned schedule performance indexes,” International Journal of Project Management, vol. 27, no. 4, pp. 400–407, 2009.
[134]  R. Elshaer, “Impact of sensitivity information on the prediction of project’s duration using earned schedule method,” International Journal of Project Management, vol. 31, pp. 579–558, 2013.
[135]  W. Lipke and J. Vaughn, “Statistical process control meets earned value,” Cross Talk, vol. 13, pp. 28–29, 2000.
[136]  G. T. Bauch and C. A. Chung, “A statistical project control tool for engineering managers,” Project Management Journal, vol. 32, pp. 37–44, 2001.
[137]  Q. Wang, N. Jiang, L. Gou, M. Che, and R. Zhang, “Practical experiences of cost/schedule measure through earned value management and statistical process control,” in Software Process Change, vol. 3966 of Lecture Notes in Computer Science, pp. 348–354, Springer, Berlin, Germany, 2006.
[138]  S. S. Leu and Y. C. Lin, “Project performance evaluation based on statistical process control techniques,” Journal of Construction Engineering and Management, vol. 134, no. 10, pp. 813–819, 2008.
[139]  National Research Council, Progress in Improving Project Management at the Department of Energy, National Academy Press, Washington, DC, USA, 2001.
[140]  J. Colin and M. Vanhoucke, “Setting tolerance limits for statistical project control using earned value management,” Working Paper, Ghent University, 2013, http://www.projectmanagement.ugent.be/.
[141]  M. Vanhoucke, “Static and dynamic determinants of earned value based time forecast accuracy,” in Handbook of Research on Technology Project Management, Planning, and Operations, T. Kidd, Ed., pp. 361–374, Information Science Reference, 2009.
[142]  J. Colin and M. Vanhoucke, “A multivariate approach to statistical project control using earned value management,” Working Paper, Ghent University, 2013, http://www.projectmanagement.ugent.be/.
[143]  M. Vanhoucke, “Dynamic scheduling: if time is money, accuracy pays,” in Proceedings of the 12th International Conference on Project Management and Scheduling, vol. 1, pp. 45–48, 2010.
[144]  B. Kim and K. Reinschmidt, “Probabilistic forecasting of project duration using kalman filter and the earned value method,” Journal of Construction Engineering and Management, vol. 136, no. 8, pp. 834–843, 2010.
[145]  B. Kim and K. Reinschmidt, “Probabilistic forecasting of project duration using bayesian inference and the beta distribution,” Journal of Construction Engineering and Management, vol. 135, no. 3, pp. 178–186, 2009.
[146]  D. Christensen and S. Heise, “Cost performance index stability,” National Contract Management Journal, vol. 25, pp. 7–15, 1993.
[147]  D. Christensen and K. Payne, “Cost performance index stability—fact or fiction?” Journal of Parametrics, vol. 10, pp. 27–40, 1992.
[148]  K. Henderson and O. Zwikael, “Does project performance stability exist? A re-examination of CPI and evaluation of SPI(t) stability,” CrossTalk, vol. 21, no. 4, pp. 7–13, 2008.
[149]  W. Lipke, “Connecting earned value to the schedule,” The Measurable News, vol. 1, pp. 6–16, 2004.
[150]  M. Vanhoucke, “The impact of project schedule adherence and rework on the duration forecast accuracy of earned value metrics,” in Project Management: Practices, Challenges and Developments, Nova Science, 2013.
[151]  M. Vanhoucke, “Operations research and dynamic project scheduling: when research meets practice,” in Proceedings of the 4th International Conference on Applied Operational Research, P. Luangpaiboon, M. Moz, and V. Dedoussis, Eds., Lecture Notes in Management Science, pp. 1–8, Bangkok, Thailand, 2012.
[152]  M. Vanhoucke, A. Vereecke, and P. Gemmel, “The project scheduling game (PSG): simulating time/cost trade-offs in projects,” Project Management Journal, vol. 51, pp. 51–59, 2005.
[153]  M. Wauters and M. Vanhoucke, “A study on complexity and uncertainty perception and solution strategies for the time/cost trade-off problem,” Working Paper, Ghent University, 2013, http://www.projectmanagement.ugent.be/.
[154]  M. Vanhoucke, “The Art of Project Management: A Story about Work and Passion,” 2013, http://www.or-as.be/.
[155]  M. Vanhoucke, “Welcome to OR&S! Where students, academics and professionals come together,” pp. 1–15, 2013, http://www.or-as.be/books/research.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413