1998

最新文章

• Direction choice for accelerated convergence in hit-and-run sampling AI翻译
  作者：Kaufman, DE; Smith, RL
  作者单位：AT&T; University of Michigan System; University of Michigan
  摘要：Hit-and-Run algorithms are Monte Carlo procedures for generating points that are asymptotically distributed according to general absolutely continuous target distributions G over open bounded regions S. Applications include nonredundant constraint identification, global optimization, and Monte Carlo integration. These algorithms are reversible random walks that commonly incorporate uniformly distributed step directions. We investigate nonuniform direction choice and show that, under regularity...
• Probabilistic analyses and practical algorithms for inventory-routing models AI翻译
  作者：Chan, LMA; Federgruen, A; Simchi-Levi, D
  作者单位：Philips; Philips Research; Columbia University; Northwestern University
  摘要：We consider a distribution system consisting of a single warehouse and many geographically dispersed retailers. Each retailer faces demands for a single item which arise at a deterministic, retailer specific rate. The retailers' stock is replenished by a fleet of vehicles of limited capacity, departing and returning to the warehouse and combining deliveries into efficient routes. The cost of any given route consists of a fixed component and a component which is proportional with the total dist...
• Quality control for products supplied with warranty AI翻译
  作者：Chen, J; Yao, DD; Zheng, SH
  作者单位：Columbia University
  摘要：A batch of products is to be supplied to customers with warranty. The units in the batch are either defective or nondefective, with different lifetime distributions. The defect rate-the proportion of defects in the batch-is itself a random variable, known only in terms of its distribution. We develop a sequential quality control procedure that exploits the knowledge of the defect distribution gained through inspection, and strikes an optimal balance between the inspection repair cost and the w...
• Designing hierarchical survivable networks AI翻译
  作者：Balakrishnan, A; Magnanti, TL; Mirchandani, P
  作者单位：Pennsylvania Commonwealth System of Higher Education (PCSHE); Pennsylvania State University; Pennsylvania State University - University Park; Massachusetts Institute of Technology (MIT); Pennsylvania Commonwealth System of Higher Education (PCSHE); University of Pittsburgh
  摘要：As the computer, communication, and entertainment industries begin to integrate phone, cable, and video services and to invest in new technologies such as fiber-optic cables, interruptions in service can cause considerable customer dissatisfaction and even be catastrophic. In this environment, network providers want to offer high levels of service-in both serviceability (e.g., high bandwidth) and survivability (failure protection)-and to segment their markets, providing better technology and m...
• Performance bounds and pathwise stability for generalized vacation and polling systems AI翻译
  作者：Altman, E; Foss, S; Riehl, E; Stidham, S
  作者单位：Inria; Universite Cote d'Azur; University of North Carolina; University of North Carolina Chapel Hill
  摘要：We consider a generalized Vacation or polling system, modeled as an input-output process operating over successive cycles, in which the service mechanism can be in an up mode (processing) or down mode (e.g., vacation, walking). Our primary motivation is polling systems, in which there are several queues and the server moves cyclically between them providing some service in each. Our basic assumption is that the amount of work that leaves the system in a cycle is no less than the amount present...
• Computing loss probabilities in discrete-time queues AI翻译
  作者：Gouweleeuw, FN; Tijms, HC
  作者单位：Vrije Universiteit Amsterdam
  摘要：Discrete-time queueing systems are frequently encountered in telecommunication networks. These systems usually involve finite buffers. The purpose of this paper is to present a generally applicable method to compute the loss probability in discrete-time finite-buffer queues by using only the state probabilities in the corresponding infinite-buffer queue.
• A note on the optimal positioning of service units AI翻译
  作者：Carrizosa, E; Munoz-Marquez, M; Puerto, J
  作者单位：University of Sevilla; Universidad de Cadiz
  摘要：In this paper we address the problem of locating p mobile service units in an n-dimensional space minimizing the expected response time. It is shown that an optimal solution to the problem is a degenerate distribution for the service, concluding that it is optimal to park the p units. This extends previous results in the literature for location on a segment.
• Comments on the paper: 'Heuristic and special case algorithms for dispersion problems' by S.S. Ravi, D.J. Rosenkrantz, and G.K. Tayi AI翻译
  作者：Tamir, A
  作者单位：Tel Aviv University
• Services and military AI翻译
  作者：Berman, O
• From the editor AI翻译
  作者：Harker, PT
  作者单位：University of Pennsylvania