IDEAS home Printed from https://ideas.repec.org/a/vrs/otamic/v8y2016i1p1499-1510n13.html
   My bibliography  Save this article

Sixty years of project planning: history and future

Author

Listed:
  • Hajdu M.

    (Budapest University of Technology and Economics, 1. Műegyetem rkp. Budapest, Hungary)

  • Isaac S.

    (Ben-Gurion University of the Negev, Be’er Sheva, Israel)

Abstract

Modern project management owes its reputation to the development of modern scheduling techniques based on the theory of graphs, namely, network scheduling techniques. In 2017, these techniques are celebrating their 60th birthday. This anniversary provides the opportunity to look back at the most important achievements such as non-linear activities and new precedence relations, as well as to take a look into the future. The highlights of this subjective retrospective are the presentation of the latest results and the compilation of those problems that will probably define the priorities for future research. This paper is the extended version of the keynote lecture/ presentation that has been presented at the PBE 2016 Conference (People, Buildings and Environment, Luhačovice, Czech Republic) (Hajdu 2016a).

Suggested Citation

  • Hajdu M. & Isaac S., 2016. "Sixty years of project planning: history and future," Organization, Technology and Management in Construction, Sciendo, vol. 8(1), pages 1499-1510, December.
    • Handle: RePEc:vrs:otamic:v:8:y:2016:i:1:p:1499-1510:n:13
    DOI: 10.1515/otmcj-2016-0013
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/otmcj-2016-0013
    Download Restriction: no
    File URL: https://libkey.io/10.1515/otmcj-2016-0013?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Thomas J. Hindelang & John F. Muth, 1979. "A Dynamic Programming Algorithm for Decision CPM Networks," Operations Research, INFORMS, vol. 27(2), pages 225-241, April.
    2. Trietsch, Dan & Mazmanyan, Lilit & Gevorgyan, Lilit & Baker, Kenneth R., 2012. "Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation," European Journal of Operational Research, Elsevier, vol. 216(2), pages 386-396.
    3. Bajis Dodin, 1985. "Bounding the Project Completion Time Distribution in PERT Networks," Operations Research, INFORMS, vol. 33(4), pages 862-881, August.
    4. Richard M. Van Slyke, 1963. "Letter to the Editor---Monte Carlo Methods and the PERT Problem," Operations Research, INFORMS, vol. 11(5), pages 839-860, October.
    5. Vanhoucke, Mario & Coelho, José, 2016. "An approach using SAT solvers for the RCPSP with logical constraints," European Journal of Operational Research, Elsevier, vol. 249(2), pages 577-591.
    6. M. W. Sasieni, 1986. "Note---A Note on Pert Times," Management Science, INFORMS, vol. 32(12), pages 1652-1653, December.
    7. I. M. Premachandra & Liliana Gonzalez, 1996. "A Simulation Model Solved the Problem of Scheduling Drilling Rigs at Clyde Dam," Interfaces, INFORMS, vol. 26(2), pages 80-91, April.
    8. S Mohan & M Gopalakrishnan & H Balasubramanian & A Chandrashekar, 2007. "A lognormal approximation of activity duration in PERT using two time estimates," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 827-831, June.
    9. T. C. T. Kotiah & N. D. Wallace, 1973. "Another Look at the PERT Assumptions," Management Science, INFORMS, vol. 20(1), pages 44-49, September.
    10. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    11. Hahn, Eugene David, 2008. "Mixture densities for project management activity times: A robust approach to PERT," European Journal of Operational Research, Elsevier, vol. 188(2), pages 450-459, July.
    12. D. R. Fulkerson, 1961. "A Network Flow Computation for Project Cost Curves," Management Science, INFORMS, vol. 7(2), pages 167-178, January.
    13. Charles E. Clark, 1961. "The Greatest of a Finite Set of Random Variables," Operations Research, INFORMS, vol. 9(2), pages 145-162, April.
    14. Donald L. Keefer & Samuel E. Bodily, 1983. "Three-Point Approximations for Continuous Random Variables," Management Science, INFORMS, vol. 29(5), pages 595-609, May.
    15. D. G. Malcolm & J. H. Roseboom & C. E. Clark & W. Fazar, 1959. "Application of a Technique for Research and Development Program Evaluation," Operations Research, INFORMS, vol. 7(5), pages 646-669, October.
    16. Charles E. Clark, 1962. "Letter to the Editor---The PERT Model for the Distribution of an Activity Time," Operations Research, INFORMS, vol. 10(3), pages 405-406, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Iyer K. Chandrashekhar & Banerjee Partha S., 2019. "Identifying New Knowledge Areas to Strengthen the Project Management Institute (Pmi) Framework," Organization, Technology and Management in Construction, Sciendo, vol. 11(1), pages 1892-1903, March.
    2. Madžarević, Aleksandar & Ivezić, Dejan & Živković, Marija & Tanasijević, Miloš & Ivić, Milica, 2018. "Assessment of vulnerability of natural gas supply in Serbia: State and perspective," Energy Policy, Elsevier, vol. 121(C), pages 415-425.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Trietsch, Dan & Mazmanyan, Lilit & Gevorgyan, Lilit & Baker, Kenneth R., 2012. "Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation," European Journal of Operational Research, Elsevier, vol. 216(2), pages 386-396.
    2. Pérez, José García & Martín, María del Mar López & García, Catalina García & Sánchez Granero, Miguel Ángel, 2016. "Project management under uncertainty beyond beta: The generalized bicubic distribution," Operations Research Perspectives, Elsevier, vol. 3(C), pages 67-76.
    3. Colin, Jeroen & Vanhoucke, Mario, 2014. "Setting tolerance limits for statistical project control using earned value management," Omega, Elsevier, vol. 49(C), pages 107-122.
    4. A. Hernández-Bastida & M. P. Fernández-Sánchez, 2019. "How adding new information modifies the estimation of the mean and the variance in PERT: a maximum entropy distribution approach," Annals of Operations Research, Springer, vol. 274(1), pages 291-308, March.
    5. HerrerI´as-Velasco, José Manuel & HerrerI´as-Pleguezuelo, Rafael & van Dorp, Johan René, 2011. "Revisiting the PERT mean and variance," European Journal of Operational Research, Elsevier, vol. 210(2), pages 448-451, April.
    6. Catalina García & José Pérez & Salvador Rambaud, 2010. "Proposal of a new distribution in PERT methodology," Annals of Operations Research, Springer, vol. 181(1), pages 515-538, December.
    7. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    8. R L Bregman, 2009. "Preemptive expediting to improve project due date performance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 120-129, January.
    9. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
    10. Hahn, Eugene David, 2008. "Mixture densities for project management activity times: A robust approach to PERT," European Journal of Operational Research, Elsevier, vol. 188(2), pages 450-459, July.
    11. Zhen Song & Håkan Schunnesson & Mikael Rinne & John Sturgul, 2015. "An Approach to Realizing Process Control for Underground Mining Operations of Mobile Machines," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-17, June.
    12. Marcin Anholcer & Helena Gaspars-Wieloch, 2011. "Efficiency analysis of the Kaufmann and Dezbazeille algorithm for the deadline problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 5-18.
    13. Helena Gaspars, 2006. "A conception of a new algorithm for the project time-cost analysis," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 16(3-4), pages 5-27.
    14. Yakhchali, Siamak Haji & Ghodsypour, Seyed Hassan, 2010. "Computing latest starting times of activities in interval-valued networks with minimal time lags," European Journal of Operational Research, Elsevier, vol. 200(3), pages 874-880, February.
    15. M. Vanhoucke, 2007. "An electromagnetic time/cost trade-off optimization in project scheduling," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 07/457, Ghent University, Faculty of Economics and Business Administration.
    16. López Martín, M.M. & García García, C.B. & García Pérez, J. & Sánchez Granero, M.A., 2012. "An alternative for robust estimation in Project Management," European Journal of Operational Research, Elsevier, vol. 220(2), pages 443-451.
    17. Vanhoucke, Mario, 2005. "New computational results for the discrete time/cost trade-off problem with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 165(2), pages 359-374, September.
    18. De, Prabuddha & James Dunne, E. & Ghosh, Jay B. & Wells, Charles E., 1995. "The discrete time-cost tradeoff problem revisited," European Journal of Operational Research, Elsevier, vol. 81(2), pages 225-238, March.
    19. Kim, Byung-Cheol, 2022. "Multi-factor dependence modelling with specified marginals and structured association in large-scale project risk assessment," European Journal of Operational Research, Elsevier, vol. 296(2), pages 679-695.
    20. Akkan, Can & Drexl, Andreas & Kimms, Alf, 2000. "Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 527, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:vrs:otamic:v:8:y:2016:i:1:p:1499-1510:n:13. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.sciendo.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.