-
作者：Wasserman, KM; Olsen, TL
作者单位：University of Michigan System; University of Michigan; Washington University (WUSTL)
摘要：This paper considers a continuous-time non-Markovian parallel queueing system subject to external disturbances. The servers are mutually interfering in that their service rates are nonlinearly interdependent functions of the controls applied by the servers, and external discrete-valued continuous-time random disturbances. At certain time epochs, namely, every A time units, the servers may adjust their service rates by Chancing the values of their controls; however, the system may change its st...
-
作者：Bartholdi, JJ; Eisenstein, DD; Foley, RD
作者单位：University System of Georgia; Georgia Institute of Technology; University of Chicago
摘要：Bucket brigades are a way of sharing work on a flow line that results in the spontaneous emergence of balance and consequent high throughput. All this happens without a work-content model or traditional assembly line balancing technology. Here we show that bucket brigades can be effective even in the presence of variability in the work content. In addition, we report confirmation at the national distribution center of a major chain retailer, which experienced a 34% increase in productivity aft...
-
作者：George, JM; Harrison, JM
作者单位：Stanford University
摘要：We consider a single-server queue with Poisson arrivals, where holding costs are continuously incurred as a nondecreasing function of the queue length. The queue length evolves as a birth-and-death process with constant arrival rate lambda = 1 and with state-dependent service rates mu (n) that can be chosen from a fixed subset A of [0, infinity). Finally, there is a nondecreasing cost-of-effort function c(.) on A, and service costs are incurred at rate c(g.) when the queue length is n. The obj...
-
作者：Chick, SE; Inoue, K
作者单位：University of Michigan System; University of Michigan
摘要：Standard indifference-zone procedures that allocate computer resources to infer the best of a finite set of simulated systems are designed with a statistically conservative, least favorable configuration assumption consider the probability of correct selection (but not the opportunity cost) and assume that the cost of simulating each system is the same. Recent Bayesian work considers opportunity cost and shows that an average case analysis may be less conservative but assumes a known output va...
-
作者：Chick, SE
作者单位：University of Michigan System; University of Michigan
摘要：A number of authors have identified problematic issues with techniques used in current simulation practice for selecting probability distributions and their parameters for input to stochastic simulations. A major goal of this paper is to address some of those issues by presenting a self-consistent evaluation of the uncertainty about the mean value of the simulation output, when there is uncertainty in both the parameters and functional form of input distributions (structural uncertainty), and ...
-
作者：Gilland, WG
作者单位：University of North Carolina; University of North Carolina Chapel Hill
摘要：This paper develops a method for determining sequencing policies to effectively control a multistation closed queueing network. We assume that several job classes, with different service time distributions, share each server and should be sequenced to maximize the long-run throughput rate of the system. A Brownian control problem that approximates the original queueing network is formulated and used to develop a dynamic sequencing policy that seeks to prevent idleness, unless the system is at ...
-
作者：Ahuja, RK; Orlin, JB
作者单位：State University System of Florida; University of Florida; Massachusetts Institute of Technology (MIT)
摘要：In this paper, we study inverse optimization problems defined as follows. Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and x(0) be a given feasible solution. The solution x(0) may or may not be an optimal solution of P with respect to the cost vector c. The inverse optimization problem is to perturb the cost vector c to d so that x(0) is an optimal solution of P with respect to d and parallel tod - c parallel to (p) is minimum, wher...
-
作者：Ahuja, RK; Orlin, JB
作者单位：State University System of Florida; University of Florida; Massachusetts Institute of Technology (MIT)
摘要：We consider the problem of minimizing Sigma (j epsilonN) C-j(x(j)), subject to the following chain constraints x(1) less than or equal to x(2) less than or equal to x(3) less than or equal to ... less than or equal to x(n) where C-j(x(j)) is a convex function of x(j) for each j epsilon N = {1, 2,...,n}. This problem is a generalization of the isotonic regression problems with complete order, an important class of problems in regression analysis that has been examined extensively in the literat...
-
作者：Feng, Y; Sun, J
作者单位：National University of Singapore; National University of Singapore
摘要：The paper considers the optimal control of a single-item continuous-review inventory system with random demand and discount opportunities. Items can always be purchased with the regular order setup and variable costs. However, when a discount opportunity occurs, they can also be purchased with a different setup cost and a lower variable cost. Demands for individual items and discount opportunities occur according to independent Poisson processes. The paper proposes an algorithm to compute the ...
-
作者：Secomandi, N
作者单位：Cornell University
摘要：The paper considers the single vehicle routing problem with stochastic demands. While most of the literature has studied the a priori solution approach, this work focuses on computing a reoptimization-type routing policy. This is obtained by sequentially improving a given a priori solution by means of a rollout algorithm. The resulting rollout policy appears to be the first computationally tractable algorithm for approximately solving the problem under the reoptimization approach. After descri...
