A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
Published Online:1 May 2000https://doi.org/10.1287/ijoc.12.2.125.11894
References
- Scheduling Projects to Maximize Net Present Value—the Case of Time-Dependent, Contingent Cash Flows. European Journal of Operational Research (1996) 96:90–96Crossref, Google Scholar
- Optimal Stochastic Scheduling by Stochastic Branch-and-Bound. European Journal of Operational Research (1999) 117:396–413Crossref, Google Scholar
- Fast Simulation of Rare Events in Queuing and Reliability Models. ACM Transactions on Modeling and Computer Simulation (1995) 5:43–85Crossref, Google Scholar
- A Dynamic Programming Algorithm for Decision CPM Networks. Operations Research (1979) 27:225–241Link, Google Scholar
- Project Management with CPM, PERT and Precedence Diagramming, 3rd ed (1983) (Van Nostrand, New York)Google Scholar
- On Optimal Allocation of Indivisibles Under Uncertainty. Operations Research (1998) 46:381–395Link, Google Scholar
- A Branch and Bound Method for Stochastic Global Optimization. Mathematical Programming (1998) 83:425–450Crossref, Google Scholar
- A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions. INFOR (1977) 15:183–195Google Scholar
- Combinatorial Optimization: Algorithms and Complexity (1982) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
- Simulation and the Monte Carlo Method (1981) (Wiley, New York) Crossref, Google Scholar
- Net-Present-Value Cost/Time Tradeoff. International Journal of Project Management (1995) 13:45–49Crossref, Google Scholar
- Project Compression: A Method for Speeding Up Resource Constrained Projects Which Preserve the Activity Schedule. European Journal of Operational Research (1990) 49:140–152Crossref, Google Scholar
