Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty

Published Online:https://doi.org/10.1287/opre.2016.1528

References

  • Agrawal S, Ding Y, Saberi A, Ye Y (2012) Price of correlations in stochastic optimization. Oper. Res. 60(1):150–162.LinkGoogle Scholar
  • Agrawal S, Blaauw D, Zolotov V (2003) Statistical timing analysis for intra-die process variations with spatial correlations. Proc. Internat. Conf. Comput. Aided Design, ICCAD ’03 (IEEE Computer Society, Washington, DC), 900–907.CrossrefGoogle Scholar
  • Aldous D, Steele M (2003) The objective method: Probabilistic combinatorial optimization and local weak convergence. Kesten H, ed. Probability on Discrete Structures, Vol. 110 (Springer, Berlin), 1–72.Google Scholar
  • Banerjee A, Paul A (2008) On path correlation and PERT bias. Eur. J. Oper. Res. 189(3):1208–1216.CrossrefGoogle Scholar
  • Bereanu B (1963) On stochastic linear programming. I: Distribution problems: A single random variable. Romanian J. Pure Appl. Math. 8(4):683–697.Google Scholar
  • Bertsimas D, Natarajan K, Teo CP (2006) Persistence in discrete optimization under data uncertainty. Math. Programming 108(2):251–274.CrossrefGoogle Scholar
  • Blaauw D, Chopra K, Srivastava A, Scheffer L (2008) Statistical timing analysis: From basic principles to state of the art. IEEE Trans. Comput.-Aided Design of Integrated Circuits and Systems 27(4):589–607.CrossrefGoogle Scholar
  • Bomze IM, Dür M, Klerk ED, Roos C, Quist AJ, Terlaky T (2000) On copositive programming and standard quadratic optimization problems. J. Global Optim. 18(4):301–320.CrossrefGoogle Scholar
  • Bowman RA (1995) Efficient estimation of arc criticalities in stochastic activity networks. Management Sci. 41(1):58–67.LinkGoogle Scholar
  • Brown GG, Dell RF, Wood RK (1997) Optimization and persistence. Interfaces 27(1):15–37.LinkGoogle Scholar
  • Burer S (2009) On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Programming 120(2):479–495.CrossrefGoogle Scholar
  • Cacoullos T (1982) On upper and lower bounds for the variance of a function of a random variable. Ann. Probab. 10(3):799–809.CrossrefGoogle Scholar
  • Chang H, Sapatnekar SS (2005) Statistical timing analysis under spatial correlations. IEEE Trans. Comput.-Aided Design Integrated Circuits Systems 24(9):1467–1482.CrossrefGoogle Scholar
  • Clark EC (1961) The greatest of a finite set of random variables. Oper. Res. 9(2):145–162.LinkGoogle Scholar
  • Cox MA (1995) Simple normal approximation to the completion time distribution for a PERT network. Internat. J. Project Management 13(4):265–270.CrossrefGoogle Scholar
  • Dharmani BC (2015) Multivariate generalized Gram-Charlier series using only calculus of several variables, instead tensor calculus. Working paper, Dhirubhai Ambani Institute of Technology, Gandhinagar, India.Google Scholar
  • Dodin BM (1984) Determining the K most critical paths in PERT networks. Oper. Res. 32(4):859–877.LinkGoogle Scholar
  • Dodin BM (1985) Bounding the project completion time distribution in PERT networks. Oper. Res. 33(4):862–881.LinkGoogle Scholar
  • Dodin BM, Elmaghraby SE (1985) Approximating the criticality indices of the activities in PERT networks. Management Sci. 31(2):207–223.LinkGoogle Scholar
  • Ewbank JB, Foote BL, Kumin HJ (1974) A method for the solution of the distribution problem of stochastic linear programming. SIAM J. Appl. Math. 26(2):225–238.CrossrefGoogle Scholar
  • Fulkerson DR (1962) Expected critical path lengths in PERT networks. Oper. Res. 10(6):808–817.LinkGoogle Scholar
  • Goldstein L, Rinott Y (1996) Multivariate normal approximations by Stein’s method and size bias couplings. J. Appl. Probab. 33(1):1–17.CrossrefGoogle Scholar
  • Hagstrom JN (1988) Computational complexity of PERT problems. Networks 18(2):139–147.CrossrefGoogle Scholar
  • Hertog D-den, Klerk E-de, Roos J (2002) On convex quadratic approximation. Statistica Neerlandica 56(3):376–385.CrossrefGoogle Scholar
  • Holmquist B (1996) The d-variate vector Hermite polynomial of order k. Linear Algebra Its Appl. 237/238:155–190.CrossrefGoogle Scholar
  • Isserlis L (1918) On a formula for the product-moment coefficient of any order of a normal frequency distribution in any number of variables. Biometrika 12(1/2):134–139.CrossrefGoogle Scholar
  • Khandewal V, Srivastava A (2007) A quadratic modeling-based framework for accurate statistical timing analysis considering correlations. IEEE Trans. Very Large Scale Integration Systems 15(2):206–215.CrossrefGoogle Scholar
  • Klerk E-de, Pasechnik DV (2002) Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12(4):875–892.CrossrefGoogle Scholar
  • Kong Q, Lee CY, Teo CP, Zheng Z (2013) Scheduling arrivals to a stochastic service delivery system using copositive cones. Oper. Res. 61(3):711–726.LinkGoogle Scholar
  • Lasserre JB (2010) A “joint+marginal” approach to parametric polynomial optimization. SIAM J. Optim. 20(4):1995–2022.CrossrefGoogle Scholar
  • Le J, Li X, Pileggi LT (2004) STAC: Statistical timing analysis with correlation. Malik S, Fix L, Kahng AB, eds. Proc. 41th Design Automation Conf., DAC ’04 (ACM, New York), 83–88.CrossrefGoogle Scholar
  • Li H, Koh CK, Balakrishnan V, Chen Y (2007) Statistical timing analysis considering spatial correlations. Proc. 8th Internat. Sympos. Quality Electronic Design, ISQED ’07 (IEEE Computer Society, Washington, DC), 102–107.CrossrefGoogle Scholar
  • Lindsey JH (1972) An estimate of expected critical-path length in PERT networks. Oper. Res. 20(4):800–812.LinkGoogle Scholar
  • Löfberg J (2004) YALMIP: A Toolbox for Modeling and Optimization in MATLAB. Proc. IEEE Internat. Sympos. Computer Aided Control Systems Design, CACSD ’04 (IEEE, Piscataway, NJ), 284–289.CrossrefGoogle Scholar
  • Mallows CL (1972) A note on asymptotic joint normality. Ann. Math. Statist. 43(2):508–515.CrossrefGoogle Scholar
  • Mishra VK, Natarajan K, Tao H, Teo CP (2012) Choice prediction with semi-definite optimization when utilities are correlated. IEEE Automatic Control 57(10):2450–2463.CrossrefGoogle Scholar
  • Natarajan K, Sim M, Uichanco J (2010) Tractable robust expected utility and risk models for portfolio optimization. Math. Finance 20(4):695–731.CrossrefGoogle Scholar
  • Natarajan K, Song M, Teo CP (2009) Persistency model and its applications in choice modeling. Management Sci. 55(3):453–469.LinkGoogle Scholar
  • Natarajan K, Teo CP, Zheng Z (2011) Mixed zero-one linear programs under objective uncertainty: A completely positive representation. Oper. Res. 59(3):713–728.LinkGoogle Scholar
  • Ord JK (1991) A simple approximation to the completion time distribution for a PERT network. J. Oper. Res. Soc. 42(11):1011–1017.CrossrefGoogle Scholar
  • Parrilo PA (2000) Structured semidefinite programs and semi-algebraic geometry methods in robustness and optimization. Ph.D. dissertation, California Institute of Technology, Pasadena.Google Scholar
  • Prekopa A (1966) On the probability distribution of the optimum of a random linear program. SIAM J. Control Optim. 4(1):211–222.CrossrefGoogle Scholar
  • Ross N (2011) Fundamentals of Stein’s method. Probab. Surveys 8:210–293.CrossrefGoogle Scholar
  • Royston JP (1982) Algorithm AS 177—Expected normal order statistics (exact and approximate). J. Roy. Statist. Soc. 31(2):161–165.Google Scholar
  • Tang Q, Zjajo A, Meijs N-van-der (2012) Transistor-level gate model based statistical timing analysis considering correlations. Rosenstiel W, Thiele W, eds. Proc. Design, Automation and Test in Europe Conf. Exhibition, DATE ’12 (IEEE, Piscataway, NJ), 917–922.Google Scholar
  • Tsukiyama S, Tanaka M, Fukui B (2001) A statistical static timing analysis considering correlations between delays. Proc. 2001 Asia and South Pacific Design Automation Conf., 353–358.CrossrefGoogle Scholar
  • Villani C (2009) Optimal Transport: Old and New. Grundlehren der Mathematischen Wissenschaften (Springer, Berlin).CrossrefGoogle Scholar
  • Yao MJ, Chu WM (2007) A new approximation algorithm for obtaining the probability distribution function for project completion time. Comput. Math. Appl. 54(2):282–295.CrossrefGoogle Scholar
  • Zhan Y, Strojwas AJ, Li X, Pileggi LT, Newmark D, Sharma M (2005) Correlation-aware statistical timing analysis with non-Gaussian delay distributions. Proc. 2005 Design Automation Conf. 77–82.CrossrefGoogle Scholar
  • Zhang L, Chen W, Hu Y, Gubner JA, Chen CCP (2005) Correlation-preserved non-Gaussian statistical timing analysis with quadratic timing model. Proc. 2005 Design Automation Conf., 83–88.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.