-
作者：BOUAKIZ, M; SOBEL, MJ
作者单位：State University of New York (SUNY) System; Stony Brook University; State University of New York (SUNY) System; Stony Brook University; State University of New York (SUNY) System; Stony Brook University
摘要：A base-stock policy is shown to be optimal when a dynamic version of the news vendor model is optimized with respect to an exponential utility criterion.
-
作者：WINKLER, RL; CLEMEN, RT
作者单位：Duke University; University of Oregon
摘要：In the combination of forecasts, weighted averages that attempt to take into account the accuracy of the forecasts and any dependence among forecasts tend to perform poorly in practice. An important factor influencing this performance is the sensitivity, or instability, of the estimated weights used to generate the combined forecast. The intent of this paper is to look at this instability via graphs and the sampling distribution of the weights. Results are developed for the combination of two ...
-
作者：GALLEGO, G; MOON, I
摘要：This paper considers the Economic Lot Scheduling Problem with Reducible Setup Times (ELSP-RS), that is, determining a multiple product, single facility cyclic schedule to minimize holding and setup costs when setup times can be reduced, at the expense of setup costs, by externalizing setup operations. We develop an efficient algorithm that finds an optimal or near-optimal production schedule. Computational results indicate that dramatic savings are possible for highly utilized facilities.
-
作者：SINGHAL, K
摘要：Discrete optimal control theory is used to develop an efficient noniterative algorithm for solving the multiproduct production and work force planning problems with a quadratic cost function. The quadratic cost models allow uncertainties to be handled directly because they minimize the expected cost if unbiased expected demand forecasts are given. A real-world problem may involve as many as 200,000 variables. The noniterative algorithm makes the computations, irrespective of the number of prod...
-
作者：ALDEN, JM; SMITH, RL
作者单位：University of Michigan System; University of Michigan
摘要：By far the most common planning procedure found in practice is to approximate the solution to an infinite horizon problem by a series of rolling finite horizon solutions. Although many empirical studies have been done, this so-called rolling horizon procedure has been the subject of few analytic studies. We provide a cost error bound for a general rolling horizon algorithm when applied to infinite horizon nonhomogeneous Markov decision processes, both in the discounted and average cost cases. ...
-
作者：BAILEY, MP
摘要：We consider network optimization problems in which the weights of the edges are random variables. We develop conditions on the combinatorial structure of the problem which guarantee that the objective function value is a first passage time in an appropriately constructed continuous time Markov chain. The arc weights must be distributed exponentially, the method of solution of the deterministic problem must be greedy in a general sense, and the accumulation of objective function value during th...
-
作者：BEAN, JC; HIGLE, JL; SMITH, RL
作者单位：University of Arizona
摘要：We consider the problem of optimally meeting a stochastically growing demand for capacity over an infinite horizon. Under the assumption that demand for product follows either a nonlinear Brownian motion or a non-Markovian birth and death process, we show that this stochastic problem can be transformed into an equivalent deterministic problem. Consistent with earlier work by A. Manne, the equivalent problem is formed by replacing the stochastic demand by its deterministic trend and discounting...
-
作者：BERTSIMAS, DJ; SERVI, LD
摘要：R. Larson proposed a method to statistically infer the expected transient queue length during a busy period in O(n5) solely from the n starting and stopping times of each customer's service during the busy period and assuming the arrival distribution is Poisson. We develop a new O(n3) algorithm which uses these data to deduce transient queue lengths as well as the waiting times of each customer in the busy period. We also develop an O(n) on-line algorithm to dynamically update the current esti...
-
作者：CHAUDHRY, ML; TEMPLETON, JGC; MEDHI, J
作者单位：University of Toronto
摘要：We present an algorithm for numerically finding the limiting distribution of the number in the system for the bulk-arrival, multiserver queueing system M(x)/D/c. Sample numerical results and graphs of various quantities of interest are also presented. In all cases, the proposed method is computationally efficient, accurate and reliable for both high and low values of the model parameters. The procedure is adaptable to other queueing models in discrete and continuous time, to problems in invent...
-
作者：CHEN, H; YAO, DD
作者单位：New Jersey Institute of Technology; Columbia University
摘要：Motivated by modeling manufacturing systems in which job arrivals and processing times are essentially deterministic, but the environment is typically random, we develop a fluid model with random disruptions. The quality and relevance of such a model are supported by the following facts which we establish in this study. The fluid model is more susceptible to analysis: Its (dynamical) sample paths are continuous and piecewise linear, and its stationary behavior can be studied using standard app...
