Index Heuristics for Multiclass M/G/1 Systems with Nonpreemptive Service and Convex Holding Costs

We consider the optimal service control of a multiclass M/G/1 queueing system in which customers are served nonpreemptively and the system cost rate is additive across classes and increasing convex in the numbers present in each class. Following Whittle's approach to a class of restless bandit problems, we develop a Langrangian relaxation of the service control problem which serves to motivate the development of a class of index heuristics. The index for a particular customer class is characterised as a fair charge for service of that class. The paper develops these indices and reports an extensive numerical investigation which exhibits strong performance of the index heuristics for both discounted and average costs.     

国内3G网络共享问题之研究

随着国内3G时代的来临，3G网络共享问题越来越受到人们的关注。本文结合国内移动通信的现状，着重分析了3G网络共享的模式及经济效益，论述了3G网络共享的相应策略。     

世界各国(或地区)推进RFID的策略

介绍了一些国家和地区发展RFID的政策和推进措施，总结了各国发展RFID的共性。     

Control Policy for a Manufacturing System with Random Yield and Rework

We develop a production policy that controls work-in-process (WIP) levels and satisfies demand in a multistage manufacturing system with significant uncertainty in yield, rework, and demand. The problem addressed in this paper is more general than those in the literature in three aspects: (i) multiple products are processed at multiple workstations, and the capacity of each workstation is limited and shared by multiple operations; (ii) the behavior of a production policy is investigated over an infinite-time horizon, and thus the system stability can be evaluated; (iii) the representation of yield and rework uncertainty is generalized. Generalizing both the system structure and the nature of uncertainty requires a new mathematical development in the theory of infinite-horizon stochastic dynamic programming. The theoretical contributions of this paper are the existence proofs of the optimal stationary control for a stochastic dynamic programming problem and the finite covariances of WIP and production levels under the general expression of uncertainty. We develop a simple and explicit sufficient condition that guarantees the existence of both the optimal stationary control and the system stability. We describe how a production policy can be constructed for the manufacturing system based on the propositions derived.     

审讯过程的数学模型

本文从经济学的观点出发，利用对策论方法建立了审讯过程的数学模型，并由此研究了讯问人三种主要策略对审讯成功的效度。     

英国电信业发展的历史沿革和电信公司的扩张战略

本文对自８０年代初以来英国电信业改革和开放的主要历史阶段作一简要回顾，分析了英国电信业的两大电信公司，即英国电信（ＢＴ）与大东电信（Ｃ＆Ｗ）的发展历史以及不断演变的国际化战略。ＢＴ和Ｃ＆Ｗ的发展经验，对于力求在即将开放的全球化电信市场中占有一席之地的中国电信企业有一定的借鉴意义。     

农村电话用户市场调查与分析

受中国电信委托、原邮电部经济技术发展研究中心在全国进行一次农村电信市场调查，以了解当前农村通信市场发展潜力，本文公布了此次调查的结果，从经济能力、资费和潜在市场等方面提出了发展农话的建议 。     

原木随机存贮策略的最优化问题

本主要介绍原木经销商在周期内原木变价销售情况下的最佳期初贮存量的决策方法，在建立期望机会成本的数学模型基础上，探讨原木随机存贮策略的最优化问题。     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.     

保险管理决策中的两个问题

本文运用风险决策理论建立了分保限额与红利分派两个保险管理决策问题的数学模型,从理论和实践两个方面讨论了最优管理策略,并给出了计算实例。