Sixty years of project planning: history and future

Adlakha, V. G. (1989). A classified bibliography of research on stochastic PERT networks: 1966–1987. Information Systems and Operational Research, 27(3), pp. 272–296.AdlakhaV. G.1989A classified bibliography of research on stochastic PERT networks: 1966–1987Information Systems and Operational Research27327229610.1080/03155986.1989.11732098Search in Google Scholar

Clark, C. E. (1961). The greatest of a finite set of random variables. Operations Research, 9, pp. 145–162.ClarkC. E.1961The greatest of a finite set of random variablesOperations Research914516210.1287/opre.9.2.145Search in Google Scholar

Clark, C. E. (1962). The PERT model for the distribution of an activity time. Operations Research, 10, pp. 405–406.ClarkC. E.1962The PERT model for the distribution of an activity timeOperations Research1040540610.1287/opre.10.3.405Search in Google Scholar

Crandall, K., & Hajdu, M. (1994). A CPM költségtervezési feladat “legrosszabb” megoldása. Közlekedéstudományi szemle, 44(5), pp. 173–176. (In Hungrian).CrandallK.HajduM.1994A CPM költségtervezési feladat “legrosszabb” megoldásaKözlekedéstudományi szemle445173176(In Hungrian).Search in Google Scholar

Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, Princeton, NJ.DantzigG. B.1963Linear Programming and ExtensionsPrinceton University PressPrinceton, NJSearch in Google Scholar

de Leon, G. P. (2008). Graphical Planning method. In: PMICOS Annual Conference, Chicago, IL.de LeonG. P.2008Graphical Planning methodIn:PMICOS Annual ConferenceChicago, ILSearch in Google Scholar

Dinic, E. A. (1990). The fastest algorithm for the PERT problem with AND- and OR-nodes (the new product-new technology problem). In: Kannan, R., & Pulleyblank, W. R. (eds.). Proceedings of the International Conference on Integer Programming and Combinatorial Optimization. University of Waterloo Press, Waterloo, ON, Canada, pp. 185–187.DinicE. A.1990The fastest algorithm for the PERT problem with AND- and OR-nodes (the new product-new technology problem)In:KannanR.PulleyblankW. R.(eds.).Proceedings of the International Conference on Integer Programming and Combinatorial OptimizationUniversity of Waterloo Press, Waterloo, ON, Canada185187Search in Google Scholar

Dodin, B. M. (1985a). Bounding the project completion time distribution in PERT networks. Operations Research, 33, pp. 862–881.DodinB. M.1985aBounding the project completion time distribution in PERT networksOperations Research3386288110.1287/opre.33.4.862Search in Google Scholar

Dodin, B. M. (1985b). Approximating the distribution functions in stochastic networks. Computers & Operations Research, 12(3), pp. 251–264.DodinB. M.1985bApproximating the distribution functions in stochastic networksComputers & Operations Research12325126410.1016/0305-0548(85)90024-3Search in Google Scholar

Elmaghraby, S. E. (1989). The estimation of some network parameters in PERT model of activity networks: Review and critique. In: Slowinski, R., & Weglarz J. (eds.). Advances in Project Scheduling. Elsevier, Amsterdam, pp. 371–432.ElmaghrabyS. E.1989The estimation of some network parameters in PERT model of activity networks: Review and critiqueIn:SlowinskiR.WeglarzJ.(eds.).Advances in Project SchedulingElsevierAmsterdam37143210.1016/B978-0-444-87358-3.50021-3Search in Google Scholar

Farnum, N. R., & Stanton, L. W. (1987). Some results concerning the estimation of beta distribution parameters in PERT. Journal of the Operations Research Society, 38, pp. 287–290.FarnumN. R.StantonL. W.1987Some results concerning the estimation of beta distribution parameters in PERTJournal of the Operations Research Society3828729010.1057/jors.1987.45Search in Google Scholar

Fondahl, J. W. (1961). A Non-Computer Approach to the Critical Path Method for the Construction Industry, Technical Report #9. Department of Civil Engineering, Stanford University, Stanford, CA.FondahlJ. W.1961A Non-Computer Approach to the Critical Path Method for the Construction IndustryTechnical Report #9.Department of Civil Engineering, Stanford UniversityStanford, CASearch in Google Scholar

Fondahl, J. W. (1987). The history of modern project management: Precedence diagramming method: Origins and early developments. Project Management Journal, 18(2), pp. 33–36.FondahlJ. W.1987The history of modern project management: Precedence diagramming method: Origins and early developmentsProject Management Journal1823336Search in Google Scholar

Francis, A., & Miresco, E. T. (2000). Decision support for project management using a chronographic approach. In: Proceedings of the 2nd International Conference on Decision Making in Urban and Civil Engineering Grand Hôtel Mercure Saxe-Lafayette, 20–22 November 2000, Lyon, France, pp. 845–856. Published jointly by INSA-Lyon, ESIGEC Chambery, ENTPE-Lyon and ETS Canada. [ISBN 2868341179].FrancisA.MirescoE. T.2000Decision support for project management using a chronographic approachIn:Proceedings of the 2nd International Conference on Decision Making in Urban and Civil Engineering Grand Hôtel Mercure Saxe-Lafayette20–22 November 2000Lyon, France845856Published jointly by INSA-Lyon, ESIGEC Chambery, ENTPE-Lyon and ETS Canada. [ISBN 2868341179].Search in Google Scholar

Francis, A., & Miresco, E. T. (2002). Decision support for project management using a chronographic approach. Journal of Decision Systems, 11(3–4), pp. 383–404.FrancisA.MirescoE. T.2002Decision support for project management using a chronographic approachJournal of Decision Systems113–438340410.3166/jds.11.383-404Search in Google Scholar

Fulkerson, D. R. (1961). A network flow computation for project cost curves. Management Science, 7(2), pp. 167–178.FulkersonD. R.1961A network flow computation for project cost curvesManagement Science7216717810.1287/mnsc.7.2.167Search in Google Scholar

Gillies, D. W. (1993). Algorithms to schedule tasks with AND/OR precedence constraints. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL.GilliesD. W.1993Algorithms to schedule tasks with AND/OR precedence constraintsPhD thesis,Department of Computer Science, University of Illinois at Urbana-ChampaignUrbana, ILSearch in Google Scholar

Hahn, E. D. (2008). Mixture densities for project management activity times: A robust approach to PERT. European Journal of Operational Research, 188, pp. 450–459.HahnE. D.2008Mixture densities for project management activity times: A robust approach to PERTEuropean Journal of Operational Research18845045910.1016/j.ejor.2007.04.032Search in Google Scholar

Hajdu, M. (1993). An algorithm for solving the cost optimization problem in precedence diagramming. Periodica Politechnica Civil Engineering, 37(3), pp. 231–247.HajduM.1993An algorithm for solving the cost optimization problem in precedence diagrammingPeriodica Politechnica Civil Engineering373231247Search in Google Scholar

Hajdu, M. (1997). Network Scheduling Techniques for Construction Project Management. Kluwer Academic Publishers, Dordrecht, London, New York. 352 p. [ISBN:0-7923-4309-3].HajduM.1997Network Scheduling Techniques for Construction Project ManagementKluwer Academic PublishersDordrecht, London, New York352[ISBN:0-7923-4309-3].10.1007/978-1-4757-5951-8Search in Google Scholar

Hajdu, M. (2013). Effects of the application of activity calendars in PERT networks. Automation in Construction, 35, pp. 397–404.HajduM.2013Effects of the application of activity calendars in PERT networksAutomation in Construction3539740410.1016/j.autcon.2013.05.025Search in Google Scholar

Hajdu, M. (2015a). One relation to rule them all: The point-to-point precedence relation that substitutes the existing ones. In: Froese, T. M., Newton, L., Sadeghpour, F., & Vanier, D. J. (eds.). Proceedings of ICSC15: The Canadian Society for Civil Engineering 5th International/11th Construction Specialty Conference. 7–10 June. University of British Columbia, Vancouver, BC, Canada. doi: 10.14288/1.0076408.HajduM.2015aOne relation to rule them all: The point-to-point precedence relation that substitutes the existing onesIn:FroeseT. M.NewtonL.SadeghpourF.VanierD. J.(eds.).Proceedings of ICSC15: The Canadian Society for Civil Engineering 5th International/11th Construction Specialty Conference7–10 JuneUniversity of British Columbia, Vancouver, BC, Canada10.14288/1.0076408Open DOISearch in Google Scholar

Hajdu, M. (2015b). History and some latest development of precedence diagramming method. Organization, Technology and Management in Construction: An International Journal, 7(2), pp. 1302–1314. doi: 10.5592/otmcj.2015.2.5.HajduM.2015bHistory and some latest development of precedence diagramming methodOrganization, Technology and Management in Construction: An International Journal721302131410.5592/otmcj.2015.2.5Open DOISearch in Google Scholar

Hajdu, M. (2015c). Continuous precedence relations for better modelling overlapping activities. Procedia Engineering, 123, pp. 216–223. doi: 1016/j.proeng.2015.10.080.HajduM.2015cContinuous precedence relations for better modelling overlapping activitiesProcedia Engineering1232162231016/j.proeng.2015.10.080Open DOISearch in Google Scholar

Hajdu, M. (2015d). Precedence diagramming method: Some latest developments. In: Keynote Presentation on the Creative Construction Conference, 21–24 June, 2015. Krakow, Poland.HajduM.2015dPrecedence diagramming method: Some latest developmentsIn:Keynote Presentation on the Creative Construction Conference21–24 June, 2015Krakow, PolandSearch in Google Scholar

Hajdu, M. (2016a). Sixty years of project planning: History and future. In: Conference Proceedings of People, Buildings and Environment 2016, An International Scientific Conference, Luhačovice, Czech Republic, pp. 230–242. Brno University of Technology, Faculty of Civil Engineering, Brno, Czech Republic [ISSN: 1805-6784].HajduM.2016aSixty years of project planning: History and futureIn:Conference Proceedings of People, Buildings and Environment 2016, An International Scientific ConferenceLuhačovice, Czech Republic230242Brno University of Technology, Faculty of Civil EngineeringBrno, Czech Republic[ISSN: 1805-6784].Search in Google Scholar

Hajdu, M. (2016b). PDM time analysis with continuous and point-to-point relations: Calculations using an artificial example. Procedia Engineering, 164, pp. 57–67. doi: 10.1016/j.proeng.2016.11.592.HajduM.2016bPDM time analysis with continuous and point-to-point relations: Calculations using an artificial exampleProcedia Engineering164576710.1016/j.proeng.2016.11.592Open DOISearch in Google Scholar

Hindealng, T. J., & Muth, J. F. (1979). A dynamic programming algorithm for decision CPM networks. Operations Research, 27(2), pp. 225–241.HindealngT. J.MuthJ. F.1979A dynamic programming algorithm for decision CPM networksOperations Research27222524110.1287/opre.27.2.225Search in Google Scholar

IBM. (1964). Users’ Manual for IBM 1440 Project Control System (PCS).IBM1964Users’ Manual for IBM 1440 Project Control System (PCS)Search in Google Scholar

Johnson, D. (1997). The triangular distribution as a proxy for the beta distribution in risk analysis. Journal of the Royal Statistical Society: Series D (The Statistician), 46, pp. 387–398. doi: 10.1111/1467-9884.00091.JohnsonD.1997The triangular distribution as a proxy for the beta distribution in risk analysisJournal of the Royal Statistical Society: Series D (The Statistician)4638739810.1111/1467-9884.00091Open DOISearch in Google Scholar

Kamburowski, J. (1992). Bounding the distribution of project duration in PERT networks. Operations Research Letters, 12(1), pp. 17–22.KamburowskiJ.1992Bounding the distribution of project duration in PERT networksOperations Research Letters121172210.1016/0167-6377(92)90017-WSearch in Google Scholar

Kamburowski, J. (1997). New validations of PERT times. Omega, 25(3), pp. 323–328.KamburowskiJ.1997New validations of PERT timesOmega25332332810.1016/S0305-0483(97)00002-9Search in Google Scholar

Keefer, D. L., & Bodily, S. E. (1983). Three-point approximations for continuous random variables. Management Science, 29(5), pp. 595–609.KeeferD. L.BodilyS. E.1983Three-point approximations for continuous random variablesManagement Science29559560910.1287/mnsc.29.5.595Search in Google Scholar

Kelley, J. E. (1961). Critical path planning and scheduling: Mathematical basis. Operations Research, 9(3), pp. 296–320.KelleyJ. E.1961Critical path planning and scheduling: Mathematical basisOperations Research9329632010.1287/opre.9.3.296Search in Google Scholar

Kelley, J. E. (1989). The origins of CPM: A personal history. PM Network, III(2) PMI: USA.KelleyJ. E.1989The origins of CPM: A personal historyPM NetworkIII2PMIUSASearch in Google Scholar

Kelley, J. E., & Walker, M. E. (1959). Critical path planning and scheduling. In: Proceedings of the Eastern Joint Computer Conference, 1–3 December 1959 Boston, MA, pp. 160–173.KelleyJ. E.WalkerM. E.1959Critical path planning and schedulingIn:Proceedings of the Eastern Joint Computer Conference1–3 December 1959Boston, MA16017310.1145/1460299.1460318Search in Google Scholar

Kim, S. (2010). Advanced Networking Technique. Kimoondang, South Korea.KimS.2010Advanced Networking TechniqueKimoondangSouth Korea10.1007/978-3-642-13405-0Search in Google Scholar

Kim, S. (2012). CPM schedule summarizing function of the beeline diagramming method. Journal of Asian Architecture and Building Engineering, 11(2), pp. 367–374.KimS.2012CPM schedule summarizing function of the beeline diagramming methodJournal of Asian Architecture and Building Engineering11236737410.3130/jaabe.11.367Search in Google Scholar

Klafszky, E. (1969). Hálózati folyamok (Network Flows). Bolyai Jáns Mathematical Society Akadémiai Kiadó, Budapest.KlafszkyE.1969Hálózati folyamok (Network Flows)Bolyai Jáns Mathematical Society Akadémiai KiadóBudapestSearch in Google Scholar

Kotiah, T. C. T., & Wallace, N. D. (1973). Another look at the PERT asssumptions. Management Science, 20(3–4), pp. 44–49.KotiahT. C. T.WallaceN. D.1973Another look at the PERT asssumptionsManagement Science203–4444910.1287/mnsc.20.1.44Search in Google Scholar

Krishnamoorty, M. S., & Deon, N. (1979). Complexity of minimum-dummy-activities problem in a PERT Network. Networks, 9. pp. 189–194.KrishnamoortyM. S.DeonN.1979Complexity of minimum-dummy-activities problem in a PERT NetworkNetworks918919410.1002/net.3230090302Search in Google Scholar

Lucko, G. (2009). Productivity Scheduling Method: Linear schedule analysis with singularity functions. Journal of Construction Engineering and Management, 135(4), pp. 246–253.LuckoG.2009Productivity Scheduling Method: Linear schedule analysis with singularity functionsJournal of Construction Engineering and Management135424625310.1061/(ASCE)0733-9364(2009)135:4(246)Search in Google Scholar

Malcolm, D. G., Roseboom, J. H., Clark, C. E., & Fazar W. (1959). Application of a technique for a research and development program evaluation. Operations Research, 7, pp. 646–669.MalcolmD. G.RoseboomJ. H.ClarkC. E.FazarW.1959Application of a technique for a research and development program evaluationOperations Research764666910.1287/opre.7.5.646Search in Google Scholar

Malyusz, L., & Hajdu, M. (2009). How would you like it? Shorter or cheaper? Organization Technology and Management in Construction, 1(2), pp. 59–63.MalyuszL.HajduM.2009How would you like it? Shorter or cheaper?Organization Technology and Management in Construction125963Search in Google Scholar

Massay, R. S. (1963). Program evaluation review technique: Its origins and development. Master's thesis, The American University, Washington, DC.MassayR. S.1963Program evaluation review technique: Its origins and developmentMaster's thesis,The American UniversityWashington, DCSearch in Google Scholar

Meyer, W. L., & Shaffer, L. R. (1963). Extension of the Critical Path Method Through the Application of Integer Programming, Technical Report. Department of Civil Engineering, University of Illinois, Urbana, IL.MeyerW. L.ShafferL. R.1963Extension of the Critical Path Method Through the Application of Integer ProgrammingTechnical Report.Department of Civil Engineering, University of IllinoisUrbana, ILSearch in Google Scholar

Mohan, S., Gopalakrishnan, M., Balasubramanian, H., & Chandrashekar, A. (2007). A lognormal approximation of activity duration in PERT using two time estimates. Journal of the Operational Research Society, 58, pp. 827–831.MohanS.GopalakrishnanM.BalasubramanianH.ChandrashekarA.2007A lognormal approximation of activity duration in PERT using two time estimatesJournal of the Operational Research Society5882783110.1057/palgrave.jors.2602204Search in Google Scholar

Möhring, R. H., Skutella, M., & Stork, F. (2004). Scheduling with and/or precedence constraints. SIAM Journal on Computing, 33(2), pp. 393–415.MöhringR. H.SkutellaM.StorkF.2004Scheduling with and/or precedence constraintsSIAM Journal on Computing33239341510.1137/S009753970037727XSearch in Google Scholar

Plotnick, FL. (2004). Introduction to modified sequence logic. In: Conference Proceedings, PMICOS Conference, April 25, 2004, Montreal, QC.PlotnickFL2004Introduction to modified sequence logicIn:Conference Proceedings, PMICOS ConferenceApril 25, 2004Montreal, QCSearch in Google Scholar

Premachandra, I. M., & Gonzales, L. (1996). A simulation model solved the problem of scheduling drilling rigs at Clyde dam. Interfaces, 26(2), pp. 80–91.PremachandraI. M.GonzalesL.1996A simulation model solved the problem of scheduling drilling rigs at Clyde damInterfaces262809110.1287/inte.26.2.80Search in Google Scholar

Roy, G. B. (1959), Théorie des Graphes: Contribution de la théorie des graphes á l1 étude de certains problémes linéaries. In: Comptes rendus des Séances de l1 Acedémie des Sciences. séence du Avril, Gauthier-Villars, 1959, pp. 2437–2449.RoyG. B.1959Théorie des Graphes: Contribution de la théorie des graphes á l1 étude de certains problémes linéariesIn:Comptes rendus des Séances de l1 Acedémie des Sciencesséence du Avril, Gauthier-Villars195924372449Search in Google Scholar

Roy, G. B. (1960), Contribution de la théorie des graphes à l’étude de certains problems d’ordonnancement. In: Comptes rendus de la 2ème conférence internationale sur la recherché opérationnelle, Aix-en-Provence. English Universities Press, Londres, pp. 171–185.RoyG. B.1960Contribution de la théorie des graphes à l’étude de certains problems d’ordonnancementIn:Comptes rendus de la 2ème conférence internationale sur la recherché opérationnelleAix-en-Provence.English Universities PressLondres171185Search in Google Scholar

Sasieni, M. W. (1986). A note on PERT times. Management Science, 32, pp. 405–406.SasieniM. W.1986A note on PERT timesManagement Science3240540610.1287/mnsc.32.12.1652Search in Google Scholar

Schwindt, C., & Zimmermann, J. (2015). Handbook on Project Management and Scheduling. Springer, Switzerland (ISBN 978-3-319-05442-1).SchwindtC.ZimmermannJ.2015Handbook on Project Management and SchedulingSpringerSwitzerland(ISBN 978-3-319-05442-1).10.1007/978-3-319-05443-8Search in Google Scholar

Siemens, N. (1971). A simple time-cost trade-off algorithm. Management Science, 17(6), pp. 354–363.SiemensN.1971A simple time-cost trade-off algorithmManagement Science17635436310.1287/mnsc.17.6.B354Search in Google Scholar

Trietsch, D., Mazmanyan, L., Gevorgyan, L., & Baker, K. R. (2012). Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation. European Journal of Operations Research, 216(2), pp. 386–396.TrietschD.MazmanyanL.GevorgyanL.BakerK. R.2012Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validationEuropean Journal of Operations Research216238639610.1016/j.ejor.2011.07.054Search in Google Scholar

Van Slyke, R. M. (1963). Monte Carlo methods and the PERT problem. Operational Research, 11, pp. 839–861.Van SlykeR. M.1963Monte Carlo methods and the PERT problemOperational Research1183986110.1287/opre.11.5.839Search in Google Scholar

Vanhoucke, M., & Coelho, J. (2016). An approach using SAT solvers for the RCPSP with logical constraints. European Journal of Operations Research, 249(2), pp. 577–591.VanhouckeM.CoelhoJ.2016An approach using SAT solvers for the RCPSP with logical constraintsEuropean Journal of Operations Research249257759110.1016/j.ejor.2015.08.044Search in Google Scholar

Yao, M., & Chu, W. (2007). A new approximation algorithm for obtaining the probability distribution function for project completion time. Computers and Mathematics with Applications, 54, pp. 282–295.YaoM.ChuW.2007A new approximation algorithm for obtaining the probability distribution function for project completion timeComputers and Mathematics with Applications5428229510.1016/j.camwa.2007.01.036Search in Google Scholar