32
Views
4
CrossRef citations to date
0
Altmetric
Theoretical Paper

Preemptive expediting to improve project due date performance

Pages 120-129 | Received 01 Jul 2006, Accepted 01 Aug 2007, Published online: 21 Dec 2017

References

  • BaiocchiGUsing Perl for statistics: Data processing and statistical computingJ Stat Software20041117510.18637/jss.v011.i01
  • BakerBMCost/time tradeoff analysis for the critical path method: A derivation of the network flow approachJ Opl Res Soc1997481241124410.1057/palgrave.jors.2600489
  • BeinWWKamburowskiJStallmannMFMOptimal reduction of two-terminal directed acyclic graphsSIAM J Comput1992211112112910.1137/0221065
  • BermanEBResource allocation in PERT network under continuous time-cost functionsMngt Sci19641073474510.1287/mnsc.10.4.734
  • BildsonRAGillespieJRCritical path planning—PERT integrationOpns Res19621090991210.1287/opre.10.6.909
  • BilsteinNRadermacherFJTime-cost optimizationMeth Opns Res197727274294
  • Bregman RL (2006). A heuristic procedure for solving the dynamic probabilistic project expediting problem. Working paper, University of Houston.
  • Cavanaugh J (2001). PDL—The Perl Data Language, version 2.4.2. Available at http://pdl.perl.org.
  • ChristiansenTTorkingtonNPerl Cookbook2003
  • ClarkCEThe optimum allocation of resources among the activities of a networkJ Ind Eng1961121117
  • CrowstonWNetwork reduction and solutionOpl Res Quart19702143545010.1057/jors.1970.93
  • CrowstonWThompsonGLDecision CPM: A method for simultaneously planning, scheduling, and control of projectsOpns Res19671540742610.1287/opre.15.3.407
  • DavisEWResource allocation in project network models—a surveyJ Ind Eng196617177188
  • DePDunneEJGhoshJBWellsCEThe discrete time-cost tradeoff problem revisitedEur J Opl Res19958122523810.1016/0377-2217(94)00187-H
  • DePDunneEJGhoshJBWellsCEComplexity of the discrete time-cost tradeoff problem for project networksOpns Res19974530230610.1287/opre.45.2.302
  • DemeulemeesterBElmaghrabySEHerroelenWOptimal procedures for the discrete time/cost trade-off problem in project networksEur J Opl Res199688506810.1016/0377-2217(94)00181-2
  • DemeulemeesterBDe ReyckBFoubertBHerroelenWVanhouckeMNew computational results on the discrete time/cost trade-off problem in project networksJ Opl Res Soc1998491153116310.1057/palgrave.jors.2600634
  • ElmaghrabySEOn the expected durations of PERT networksMngt Sci19671329930610.1287/mnsc.13.5.299
  • ElmaghrabySEActivity Networks: Project Planning and Control by Network Models1977
  • ElmaghrabySESalemAMOptimal project compression under quadratic cost functionsAppl Mngt Sci19822139
  • FoldesSFSoumisFPERT and crashing revisited: Mathematical generalizationsEur J Opl Res19936428629410.1016/0377-2217(93)90183-N
  • FulkersonDRA network flow computation for project cost curveMngt Sci1961716717810.1287/mnsc.7.2.167
  • FulkersonDRExpected critical path lengths in PERT networksOpns Res19621080881710.1287/opre.10.6.808
  • GoyalSKA note on the paper: A simple CPM time/cost trade-off algorithmMngt Sci19752171872210.1287/mnsc.21.6.718
  • GrayCFLarsonEWProject Management: The Managerial Process2005
  • GutjahrWJStraussCWagnerEA stochastic branch-and-bound approach to activity crashing in project managementINFORMS J Comput20001212513510.1287/ijoc.12.2.125.11894
  • HarveyRTPattersonJHAn implicit enumeration algorithm for the time/cost tradeoff problem in project network analysisFound Control Eng19794107117
  • Hedden JD (2006). Math-Random-MT-Auto version 5.02. Available at http://www.cpan.org.
  • HindelangTJMuthJFA dynamic programming algorithm for Decision CPM networksOpns Res19792722524110.1287/opre.27.2.225
  • KaimannRACoefficient of network complexityMngt Sci19742117217710.1287/mnsc.21.2.172
  • KelleyJEJr.Critical-path planning and scheduling: Mathematical basisOpns Res1961929632010.1287/opre.9.3.296
  • KelleyJEJr.WalkerMRCritical-path planning and scheduling: An introduction1959 Proceedings of the Eastern Joint Computer Conference1959160173
  • KlingelARJr.Bias in PERT project completion time calculations for a real networkMngt Sci196613B194B20110.1287/mnsc.13.4.B194
  • LambersonLRHockingRROptimum time compression in project schedulingMngt Sci197016B597B60610.1287/mnsc.16.10.B597
  • LevyFKThompsonGLWiestJDThe ABCs of the critical path methodHarvard Bus Rev19634198108
  • MacCrimmonKRRyavecCAAn analytical study of the PERT assumptionsOpns Res196412163710.1287/opre.12.1.16
  • Marsaglia G (1996). DIEHARD: A Battery of Tests of Randomness. Available at http://stat.fsu.edu/pub/diehard/.
  • MatsumotoMNishimuraTA 623-dimensionally equidistributed uniform pseudorandom number generatorACM Trans Model Comput Simul1998833010.1145/272991.272995
  • Menon-Sen A (2001). Math-Random-MT-1.04. Available at http://www.cpan.org.
  • MeredithJRMantelSJProject Management: A Managerial Approach2005
  • Meyer WL and Shaffer LR (1963). Extensions of the critical path through the application of integer programming. Report issued by the Department of Civil Engineering, University of Illinois.
  • ModerJJPhillipsCRProject Management with CPM and PERT1964
  • PanagiotakopoulosDA CPM time-cost computational algorithm for arbitrary activity cost functionsINFOR197715183195
  • PascoeTLAllocation of resources—CPMRev Fr Rech Op1966383138
  • PhillipsSJr.Project management duration/resource tradeoff analysis: An application of the cut search approachJ Opl Res Soc19964769770110.1057/jors.1996.81
  • PhillipsSJr.DessoukyMISolving the project time/cost tradeoff problem using the minimal cut conceptMngt Sci19772439340010.1287/mnsc.24.4.393
  • RobinsonDRA dynamic programming solution to cost-time tradeoff for CPMMngt Sci19752215816610.1287/mnsc.22.2.158
  • SalemAMElmaghrabySEOptimal linear approximation in project compressionIIE Trans19841633934710.1080/07408178408975253
  • SAS Institute (2003). SAS version 9.1. SAS Institute: Cary, North Carolina, USA.
  • SchonbergerRJWhy projects are ‘always' late: A rationale based on manual simulation of a PERT/CPM networkInterfaces1981115667010.1287/inte.11.5.66
  • SiemensNA simple CPM time/cost trade-off algorithmMngt Sci197117B354B36310.1287/mnsc.17.6.B354
  • SiemensNGoodingCReducing project duration at minimum cost: A time/cost trade-off algorithmOmega: Int J Mngt Sci1975356958110.1016/0305-0483(75)90030-4
  • Van SlykeRMMonte Carlo methods and the PERT problemOpns Res19631183986010.1287/opre.11.5.839
  • Wall L (2006). Practical Extraction and Report Language (Perl), Version 5.8.8. Available at http://www.perl.org.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.