Zobrazeno 1 - 10
of 101
pro vyhledávání: '"Paul Zipkin"'
Publikováno v:
SSRN Electronic Journal.
We study an inventory system with multiple supply sources and expediting options. The replenishment lead times from each supply source are stochastic, representing congestion and disruption. We construct a family of smart ordering and expediting poli
Publikováno v:
Operations Research. 65:379-395
We consider a single-product, two-source inventory system with Poisson demand and backlogging. Inventory can be replenished through a normal supply source, which consists of a two-stage tandem queue with exponential production time at each stage. We
Autor:
Paul Zipkin
Publikováno v:
Operations Research Letters. 44:136-142
Assemble-to-order systems are important in practice but challenging computationally. This paper combines some notions from combinatorial optimization, namely polymatroids and discrete convexity, to ease the computational burden significantly, for cer
Autor:
Paul Zipkin, Jing-Sheng Song
Publikováno v:
Manufacturing & Service Operations Management. 15:444-457
A supply stream is a continuous version of a supply chain. It is like a series inventory system, but stock can be held at any point along a continuum, not just at discrete stages. We assume stationary parameters and aim to minimize the long-run avera
Publikováno v:
SSRN Electronic Journal.
We consider a single-product, two-source inventory system with Poisson demand and backlogging. Inventory can be replenished through a normal supply source, which consists of a two-stage tandem queue with exponential production time at each stage. We
Autor:
Paul Zipkin
Publikováno v:
Annals of Operations Research. 241:201-224
This paper studies the large-t behavior of the boundary generated by the method of images for the first-passage-time problem. We show that this behavior is characterized by certain properties of the Laplace transform of the input measure. Such proper
Autor:
Paul Zipkin
Publikováno v:
Annals of Operations Research. 208:227-243
The inverse method of images is a relatively easy way to find approximate solutions to first-passage time problems. We extend the method in several ways: We use a linear program instead of a system of linear equations; we utilize asymptotic informati
Autor:
Paul Zipkin
Publikováno v:
J. Appl. Probab. 48, no. 3 (2011), 713-722
Durbin (1992) derived a convergent series for the density of the first passage time of a Weiner process to a curved boundary. We show that the successive partial sums of this series can be expressed as the iterates of the standard substitution method
Autor:
Jing-Sheng Song, Paul Zipkin
Publikováno v:
Adv. in Appl. Probab. 43, no. 1 (2011), 264-275
We propose an approximation for the inverse first passage time problem. It is similar in spirit and method to the tangent approximation for the original first passage time problem. We provide evidence that the technique is quite accurate in many case
Autor:
Tetsuo Iida, Paul Zipkin
Publikováno v:
Operations Research. 58:1350-1363
We consider a serial supply chain with one supplier and one retailer. Each obtains some demand forecast information, which may be shared or not. We investigate the members' benefits from sharing information. The forecasts follow a variant of the Mart