Operations Research

最新文章

• A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness AI翻译
  作者：Wu, SD; Byeon, ES; Storer, RH
  作者单位：Lehigh University; Korea Transport Institute
  摘要：In this paper we study the weighted tardiness job-shop scheduling problem, taking into consideration the presence of random shop disturbances. A basic thesis of the paper is that global scheduling performance is determined primarily by a subset of the scheduling decisions to be made. By making these decisions in an a priori static fashion, which maintains a global perspective, overall performance efficiency can be achieved. Further, by allowing the remaining decisions to be made dynamically, f...
• Partition-reversible Markov processes AI翻译
  作者：Alexopoulos, C; El-Tannir, AA; Serfozo, RF
  作者单位：University System of Georgia; Georgia Institute of Technology; American University of Beirut
  摘要：This study introduces a generalization of reversibility called partition-reversibility. A Markov jump process is partition-reversible if the average numbers of its transitions between sets that partition the state space are equal. In this case, its stationary distribution is obtainable by solving the balance equations separately on the sets. We present several characterizations of partition-reversibility and identify subclasses of treelike, starlike, and circular partition-reversible processes...
• Order-fulfillment performance measures in an assemble-to-order system with stochastic leadtimes AI翻译
  作者：Song, JS; Xu, SH; Liu, B
  作者单位：University of California System; University of California Irvine; Pennsylvania Commonwealth System of Higher Education (PCSHE); Pennsylvania State University; Pennsylvania State University - University Park; Chinese Academy of Sciences
  摘要：We study a multicomponent, multiproduct production and inventory system in which individual components are made to stock but final products are assembled to customer orders. Each component is produced by an independent production facility with finite capacity, and the component inventory is controlled by an independent base-stock policy. For any given base-stock policy, we derive the key performance measures, including the probability of fulfilling a customer order within any specified time wi...
• (s, S) continuous review models for products with fixed lifetimes AI翻译
  作者：Liu, LM; Lian, ZT
  作者单位：Hong Kong University of Science & Technology; University of Massachusetts System; University of Massachusetts Amherst
  摘要：We analyze an (s, S) continuous review perishable inventory system with a general renewal demand process and instantaneous replenishments. Though continuous review systems seem more amenable to optimization analysis than do periodic review systems, the existing literature addressing this type of model is rather limited. This limitation motivated us to seek greater understanding of this important class of inventory models. Using a Markov renewal approach, we obtain closed-form solutions for the...
• Good parameters and implementations for combined multiple recursive random number generators AI翻译
  作者：L'Ecuyer, P
  作者单位：Universite de Montreal
  摘要：Combining parallel multiple recursive sequences provides an efficient way of implementing random number generators with long periods and good structural properties. Such generators are statistically more robust than simple linear congruential generators that fit into a computer word. We made extensive computer searches for good parameter sets, with respect to the spectral test, for combined multiple recursive generators of different sizes. We also compare different implementations and give a s...
• A simple heuristic for m-machine flow-shop and its applications in routing-scheduling problems AI翻译
  作者：Averbakh, I; Berman, O
  作者单位：Western Washington University; University of Toronto
  摘要：We consider the routing-scheduling version of the flow-shop problem, where n jobs located at different nodes of a transportation network must be executed by m machines (servers) travelling between the jobs,The objective is to minimize the makespan. For this problem, we present a simple heuristic and analyze its worst-case performance.
• Simulation AI翻译
  作者：Kelton, WD
  作者单位：University System of Ohio; University of Cincinnati
• Decision technology AI翻译
  作者：Kimbrough, SO
  作者单位：University of Pennsylvania
• Algorithms for separable nonlinear resource allocation problems AI翻译
  作者：Kodialam, MS; Luss, H
  作者单位：Nokia Corporation; Nokia Bell Labs; AT&T
  摘要：We consider a simple resource allocation problem with a single resource constraint. The objective function is composed of separable, convex performance functions, one for each activity. Likewise, the constraint has separable, convex resource-usage functions, one for each activity. The objective is to minimize the sum of the performance functions, subject to satisfying the resource constraint and nonnegativity constraints. This problem extends the well-studied problem in which the resource cons...
• On derivative estimation of the mean time to failure in simulations of highly reliable Markovian systems AI翻译
  作者：Nakayama, MK
  作者单位：New Jersey Institute of Technology
  摘要：The mean time to failure (MTTF) of a Markovian system can be expressed as a ratio of two expectations. For highly reliable Markovian systems, the resulting ratio formula consists of one expectation that cannot be estimated with bounded relative error when using standard simulation, while the other, which we call a nonrare expectation, can be estimated with bounded relative error. We show that some derivatives of the nonrare expectation cannot be estimated with bounded relative error when using...