Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing

In this paper, we present the heavy‐traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

基于三对Bell态纠缠交换的QDKD方案

提出了一种基于三对Bell态纠缠交换的量子确定性密钥分发方案(Quantum Deterministic Key Distribution,QDKD),该方案充分利用量子纠缠交换的原理,通过对三对Bell态进行纠缠、测量操作,并辅以经典信息实现确定性密钥的分发,方案中任何窃听行为都会被及时发现。同基于两对Bell态纠缠交换的QDKD方案相比,协议利用三对Bell态并使用两种方法实现确定性密钥信息的分发。分析结果表明,方案仅用到两粒子纠缠态,没有涉及任何幺正操作,操作性强,密钥分发效率高。     

Review of the ordered and proportionate flow shop scheduling research

Ordered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

被动声纳浮标目标运动分析及其仿真计算

针对直升机搜索潜艇的特点,研究了被动声纳浮标目标运动分析问题。对固定目标和匀速直线运动目标,分别应用确定性计算和线性最小二乘法进行数学建模及其仿真。仿真结果表明该模型可行,能对被动式声纳浮标搜潜的目标定位提供算法依据。     

Scheduling multiple products on parallel machines with setup costs

We consider a class of production scheduling models with m identical machines in parallel and k different product types. It takes a time p_i to produce one unit of product type i on any one of the machines. There is a demand stream for product type i consisting of n_i units with each unit having a given due date. Before a machine starts with the production of a batch of products of type i a setup cost c is incurred. We consider several different objective functions. Each one of the objective functions has three components, namely a total setup cost, a total earliness cost, and a total tardiness cost. In our class of problems we find a relatively large number of problems that can be solved either in polynomial time or in pseudo‐polynomial time. The polynomiality or pseudo‐polynomiality is achieved under certain special conditions that may be of practical interest; for example, a regularity pattern in the string of due dates combined with earliness and tardiness costs that are similar for different types of products. The class of models we consider includes as special cases discrete counterparts of a number of inventory models that have been considered in the literature before, e.g., Wagner and Whitin (Manage Sci 5 (1958), 89–96) and Zangwill (Oper Res 14 (1966), 486–507; Manage Sci 15 (1969), 506–527). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Interval scheduling: A survey

In interval scheduling, not only the processing times of the jobs but also their starting times are given. This article surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given “maximal” machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Scheduling patients in an ambulatory surgical center

This paper presents a deterministic approach to schedule patients in an ambulatory surgical center (ASC) such that the number of postanesthesia care unit nurses at the center is minimized. We formulate the patient scheduling problem as new variants of the no‐wait, two‐stage process shop scheduling problem and present computational complexity results for the new scheduling models. Also, we develop a tabu search‐based heuristic algorithm to solve the patient scheduling problem. Our algorithm is shown to be very effective in finding near optimal schedules on a set of real data from a university hospital's ASC. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

On the effectiveness of returns policies in the price‐dependent newsvendor model

We study in this paper the price‐dependent (PD) newsvendor model in which a manufacturer sells a product to an independent retailer facing uncertain demand and the retail price is endogenously determined by the retailer. We prove that for a zero salvage value and some expected demand functions, in equilibrium, the manufacturer may elect not to introduce buybacks. On the other hand, if buybacks are introduced in equilibrium, their introduction has an insignificant effect on channel efficiency improvement, but, by contrast, may significantly shift profits from the retailer to the manufacturer. We further demonstrate that the introduction of buybacks increases the wholesale price, retail price, and inventory level, as compared to the wholesale price‐only contract, and that the corresponding vertically integrated firm offers the lowest retail price and highest inventory level. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

提供有界延迟服务的网络结构

将来的计算机网络必须支持具有不同通信量和不同服务质量（ＱｏＳ）要求的应用，有界延迟服务保证所有应用包的延迟都不超过给定延迟上界。本文首先提出有界延迟实时服务网络的框架，详细说明了其关键部件的功能和工作原理，并阐述了分析它们性能的技术，最后讨论了设计有界延迟服务网络在性能与实现复杂性之间的折衷。