Supply Streams

Published Online:https://doi.org/10.1287/msom.2013.0431

References

  • Axsäter S, Lundell P. In-process safety stocks. Proc. 23rd IEEE Conf. Decision and Control (1984) 23:839–842CrossrefGoogle Scholar
  • Bather J. A continuous time inventory model. J. Appl. Probab. (1966) 3:538–549CrossrefGoogle Scholar
  • Berling P, Martínez-de-Albéniz V. A characterization of optimal base-stock levels for a continuous-stage serial supply chain. (2011a) . Working paper, IESE Business School, Barcelona, SpainGoogle Scholar
  • Berling P, Martínez-de-Albéniz V. Optimal expediting decisions in a continuous-stage serial supply chain. (2011b) . Working paper, IESE Business School, Barcelona, SpainGoogle Scholar
  • Broadie M, Yamamoto Y. Application of the fast Gauss transform to option pricing. Management Sci. (2003) 49:1071–1088LinkGoogle Scholar
  • Cannon J. The One-Dimensional Heat Equation (1984) (Cambridge University Press, Cambridge, UK) CrossrefGoogle Scholar
  • Chaudhari G. Cost-time profiling as a tool in value engineering. Value World (2007) 30:1–8Google Scholar
  • Chen F, Zheng Y. Lower bounds for multi-echelon stochastic inventory systems. Management Sci. (1994) 40:1426–1443LinkGoogle Scholar
  • Chen H, Yao D. Fundamentals of Queueing Networks (2001) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Cheng L, Chen X, Chadam J, Saunders D. Analysis of an inverse first passage problem from risk management. SIAM J. Math. Anal. (2007) 38:845–873CrossrefGoogle Scholar
  • Clark A, Scarf H. Optimal policies for a multi-echelon inventory problem. Management Sci. (1960) 6:475–490LinkGoogle Scholar
  • Crank J. Free and Moving Boundary Problems (1987) (Oxford University Press, Oxford, UK) Google Scholar
  • Daniels H. Sequential tests constructed from images. Ann. Statist. (1982) 10:394–400CrossrefGoogle Scholar
  • Daniels H. Approximating the first crossing-time density for a curved boundary. Bernoulli (1996) 2:133–143CrossrefGoogle Scholar
  • DeCroix G, Song J, Zipkin P. A series system with returns: Stationary analysis. Oper. Res. (2005) 53:350–362LinkGoogle Scholar
  • de Kok TG, Fransoo JC, de Kok AG, Graves SC. Planning supply chain operations: Definition and comparison of planning concepts. Supply Chain Management: Design, Coordination and Operation (2003) 11(Elsevier, Amsterdam) Handbooks in Operations Research and Management ScienceChap. 12CrossrefGoogle Scholar
  • Doğru MK, van Houtum G, de Kok AG. Newsvendor equations for optimal reorder levels of multi-echelon inventory systems with fixed batch sizes. Oper. Res. Lett. (2008) 36:551–556CrossrefGoogle Scholar
  • Dong L, Lee H. Optimal policies and approximations for a serial multiechelon inventory system with time-correlated demand. Oper. Res. (2003) 51:969–980LinkGoogle Scholar
  • Durbin J. A reconciliation of two different expressions for the first-passage density of Brownian motion to a curved boundary. J. Appl. Probab. (1988) 25:829–832CrossrefGoogle Scholar
  • Durbin J. The first-passage density of the Brownian motion process to a curved boundary. J. Appl. Probab. (1992) 29:291–304CrossrefGoogle Scholar
  • Federgruen A, Zipkin P. Computational issues in an infinite-horizon, multiechelon inventory model. Oper. Res. (1984) 32:818–836LinkGoogle Scholar
  • Fleming W, Soner M. Controlled Markov Processes and Viscosity Solutions (1993) (Springer-Verlag, New York) Google Scholar
  • Fooks J. Profiles for Performance (1993) (Addison-Wesley, Reading, MA) Google Scholar
  • Gallego G, Özer Ö. A new algorithm and a new heuristic for serial supply systems. Oper. Res. Lett. (2005) 33:349–362CrossrefGoogle Scholar
  • Gallego G, Zipkin P. Stock positioning and performance estimation for serial production-transportation systems. Manufacturing Service Oper. Management (1999) 1:77–88LinkGoogle Scholar
  • Greengard L, Strain J. The fast Gauss transform. SIAM J. Sci. Statist. Comput. (1991) 12:79–94CrossrefGoogle Scholar
  • Harrison J. Brownian Motion and Stochastic Flow Systems (1985) (Wiley, New York) Google Scholar
  • Jaimungal S, Kreinin A, Valov A. Integral equations and the first passage time of Brownian motion. (2009) . Working paper, University of Toronto, Toronto, ONGoogle Scholar
  • Kumar S, Muthuraman M. A numerical method for solving singular stochastic control problems. Oper. Res. (2004) 52:563–582LinkGoogle Scholar
  • Kushner H, Dupuis P. Numerical Methods for Stochastic Control Problems in Continuous Time (1992) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Lerche H. Boundary Crossing of Brownian Motion (1986) (Springer, Heidelberg) CrossrefGoogle Scholar
  • Lo V, Roberts G, Daniels H. Inverse method of images. Bernoulli (2002) 8:53–80Google Scholar
  • Narasimhan T. The discrete and the continuous: Which comes first? Current Sci. (2010) 98:1003–1005Google Scholar
  • Novikov A, Frishling V, Kordzakhia N. Approximations of boundary crossing probabilities for a Brownian motion. J. Appl. Probab. (1999) 36:1019–1030CrossrefGoogle Scholar
  • Peskir G. Limit at zero of the Brownian first-passage density. Probab. Theory Related Fields (2002a) 124:100–111CrossrefGoogle Scholar
  • Peskir G. On integral equations arising in the first-passage problem for Brownian motion. J. Integral Equations Appl. (2002b) 14:397–423CrossrefGoogle Scholar
  • Plambeck E, Ward A. Optimal control of a high-volume assemble-to-order system. Math. Oper. Res. (2006) 31:453–477LinkGoogle Scholar
  • Plambeck E, Ward A. Optimal control of a high-volume assemble-to-order system with leadtime quotation and expediting. Queueing Systems (2008) 60:1–69CrossrefGoogle Scholar
  • Redner S. A Guide to First-Passage Processes (2001) (Cambridge University Press, Cambridge, UK) CrossrefGoogle Scholar
  • Reiman M, Rubio R, Wein L. Heavy traffic analysis of the dynamic stochastic inventory-routing problem. Transportation Sci. (1999) 33:361–380LinkGoogle Scholar
  • Sato S. Evaluation of the first-passage time probability to a square root boundary for the Wiener process. J. Appl. Probab. (1977) 14:850–856CrossrefGoogle Scholar
  • Schraner E, Hausman W. Optimal production operations sequencing. IIE Trans. (1997) 29:651–660CrossrefGoogle Scholar
  • Shang K, Song J. Newsvendor bounds and heuristic for optimal policies in serial supply chains. Management Sci. (2003) 49:618–638LinkGoogle Scholar
  • Sobel M. Fill rates of single-stage and multistage supply systems. Manufacturing Service Oper. Management (2004) 6:41–52LinkGoogle Scholar
  • Song J, Zipkin P. An approximation for the inverse first-passage time problem. Ann. Appl. Probab. (2011) 43:264–275CrossrefGoogle Scholar
  • van Houtum G, Zijm W. Computational procedures for stochastic multi-echelon production systems. Internat. J. Production Econom. (1991) 23:223–237CrossrefGoogle Scholar
  • Wang L, Pötzelberger K. Boundary crossing probability for Brownian motion and general boundary. J. Appl. Probab. (1997) 34:54–65CrossrefGoogle Scholar
  • Zipkin P. Foundations of Inventory Management (2000) (McGraw-Hill, Boston) Google Scholar
  • Zipkin P. On the method of images and the asymptotic behavior of first-passage times. Ann. Oper. Res. (2013) . ForthcomingGoogle Scholar
  • Zucca C, Sacerdote L. On the inverse first-passage-time problem for a Wiener process. Ann. Appl. Probab. (2009) 19:1319–1346CrossrefGoogle 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.