-
作者：BERMAN, O; BERTSIMAS, D; LARSON, RC
作者单位：Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT)
摘要：Discretionary service facilities are providers of products and/or services that are purchased by customers who are traveling on otherwise preplanned trips such as the daily commute. Optimum location of such facilities requires them to be at or near points in the transportation network having sizable flows of different potential customers. N. Fouska (1988) and O. Berman, R. Larson and N. Fouska (ELF 1992) formulate a first version of this problem, assuming that customers would make no deviation...
-
作者：MATEJCIK, FJ; NELSON, BL
作者单位：Northwestern University; University System of Ohio; Ohio State University; University System of Ohio; Ohio State University
摘要：We consider the problem of comparing a small number of stochastic systems via computer simulation when the basis for comparison is the expected value of some system performance measure. To serve this problem we develop two-stage sampling procedures that provide confidence intervals for the difference between the expected performance of each system and the best of the others. These confidence intervals are valid under mild conditions, and the procedures allow the experimenter to specify the des...
-
作者：STEUER, RE; SUN, MH
作者单位：University of Texas System; University of Texas at San Antonio
摘要：In this paper we study the parameter space investigation method of I. M. Sobol and R. B. Statnikov. The method is a ''random hitting'' procedure for solving the kinds of small, but difficult, multiple objective nonlinear programming problems often encountered in engineering design and optimal control. Sobol and Statnikov have argued the effectiveness of their approach and its application possibilities. In this paper, we computationally test the parameter space investigation method to examine t...
-
作者：BRAMEL, J; SIMCHILEVI, D
作者单位：Northwestern University
摘要：We present a general framework for modeling routing problems based on formulating them as a traditional location problem called the capacitated concentrator location problem. We apply this framework to two classical routing problems: the capacitated vehicle routing problem and the inventory routing problem. In the former case, the heuristic is proven to be asymptotically optimal for any distribution of customer demands and locations. Computational experiments show that the heuristic performs w...
-
作者：JONES, PC; LOWE, TJ; MULLER, G; XU, N; YE, YY; ZYDIAK, JL
作者单位：University of Chicago; University of Iowa; George Mason University; Loyola University Chicago; University of Iowa
摘要：This paper considers a specially structured uncapacitated facility location problem. We show that several problems, including certain tool selection problems, substitutable inventory problems, supplier sourcing problems, discrete lot sizing problems, and capacity expansion problems, can be formulated as instances of the problem. We also show that the problem with m facilities and n customers can be solved in O(mn), as a shortest path problem on a directed graph.
-
作者：BRETTHAUER, KM; SHETTY, B
摘要：In this paper we study the nonlinear resource allocation problem, defined as the minimization of a convex function over one convex constraint and bounded integer variables. This problem is encountered in a variety of applications, including capacity planning in manufacturing and computer networks, production planning, capital budgeting, and stratified sampling. Despite its importance to these and other applications, the nonlinear resource allocation problem has received little attention in the...
-
作者：KO, CW; LEE, J; QUEYRANNE, M
作者单位：Rutgers University System; Rutgers University New Brunswick; University of British Columbia
摘要：We study the experimental design problem of selecting a most informative subset, having prespecified size, from a set of correlated random variables. The problem arises in many applied domains, such as meteorology, environmental statistics, and statistical geology. In these applications, observations can be collected at different locations, and possibly, at different times. Information is measured by ''entropy.'' In the Gaussian case, the problem is recast as that of maximizing the determinant...
-
作者：WEBSTER, S; BAKER, KR
作者单位：Dartmouth College
摘要：Economies of scale are fundamental to manufacturing operations. With respect to scheduling, this phenomenon manifests itself in efficiencies gained from grouping similar jobs together. This paper reviews the rapidly growing literature on single-machine scheduling models that incorporate benefits from job grouping. We focus on three basic models known as family scheduling with item availability, family scheduling with batch availability, and batch processing. We present known results and introd...
-
作者：GERASIMOV, AI
摘要：Analytical expressions (formulas) for normalizing constants in closed queueing networks with different classes of customers are presented and discussed in this article.
-
作者：PAPADOPOULOS, HT
摘要：This paper concerns the throughput rate of multistation reliable production lines with no intermediate buffers. Processing times at the service stations are independent, exponential random variables, possibly with different means. We extend the work started in E. J. Muth (1984) to provide an algorithm that allows for the efficient computation of longer lines and to provide results for the nonidentical server case. A result is presented which provides the distribution function of the holding ti...
