A new appointment rule for a single-server,multiple-customer service system

This paper proposes a new appointment rule for the single-server, multiple-customer service system. Unlike previous appointment rules, which perform well only in specific service environments, the new rule can be parameterized to perform well in different service environments. The new appointment rule is presented as a mathematical function of four environmental parameters, namely, the coefficient of variation of the service time, the percentage of customers' no-shows, the number of appointments per service session, and the cost ratio between the server's idle and customers' waiting cost per unit time. Once the values of these environmental parameters are estimated, the new appointment rule can be parameterized to perform well. The results show that new rule performs either as well as or better than existing appointment rules in a wide range of service environments. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 313–326, 1998     

0.13 μm标准CMOS工艺的高可靠流水线模数转换器

针对航空航天电子系统对高性能模数转换器的需求,采用0. 13μm标准互补金属氧化物半导体工艺,设计可以在极端温度和空间辐射环境中稳定可靠工作的12位分辨率、50 MS/s采样率的流水线模数转换器。通过采用无采样保持电路以及抗辐射电路和版图加固等技术,在减小功耗的同时有效地削弱总剂量辐射效应的影响。测试结果表明:在-55～125℃温度范围内以及150 krad(Si)的总剂量辐照条件下,得到大于64 dB的信噪比、大于73. 5 dB的无杂散动态范围和最大0. 22 dB的微分非线性。     

油料洞库油罐通气管道设计分析

油料洞库油罐通气管道是油罐进行大呼吸、小呼吸的通道,使油罐气体空间的正负压力处于规定的压力范围,达到保护油罐安全的作用。通过计算油罐阻火器和油罐通气管道的压力损失,结合油罐呼吸阀的压力等级、油罐收发油流量等参数,分析了不同油罐通气管道管径对油罐内正负压力的影响,提出了油罐通气管道管径的选择原则。最后就油罐通气管道内油气的燃爆特性,提出了油罐通气管道的材质要求及其附设的抗爆振性要求。     

油料洞库油罐通气管道防雷设计分析

油料洞库油罐通气管道防雷设计是油料洞库安全设计的重要组成部分。分析了油料洞库油罐通气管道的工艺组成和设计要求,根据油料洞库爆炸危险区域划分,剖析了通气管道独立避雷针的设计要求。推导了单支独立避雷针的安装高度和保护范围计算公式,算例给出了避雷针的设计计算过程。最后提出了结论及建议。     

面向点及区域目标的遥感卫星任务调度

遥感应用需求中存在点目标和区域目标两类任务,遥感卫星对两类任务的调度方式存在很大区别,将二者统一调度困难.本文将点目标视为特殊的区域目标,将它们按照卫星观测机会分解,构建元任务,将两类目标在元任务层次进行统一;根据任务类型分别构建收益函数,兼顾了二者在收益计算上的差异,并建立了面向点及区域目标的遥感卫星任务调度模型,实现了对两类任务的综合调度.仿真实例证明,此方法能够提高卫星的观测效率.     

Scheduling a maintenance activity on parallel identical machines

We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required electricity shut‐down. The objective is minimum flow‐time. The problem is shown to be NP‐hard, and moreover impossible to approximate unless P = NP. We introduce a pseudo‐polynomial dynamic programming algorithm, and show how to convert it into a bicriteria FPTAS for this problem. We also present an efficient heuristic and a lower bound. Our numerical tests indicate that the heuristic provides in most cases very close‐to‐optimal schedules. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

天基预警系统资源调度方法

对面向导弹预警任务的天基预警系统中的低轨卫星资源调度问题进行了研究.对预警任务的特性进行分析,提出了一种预警任务规划与分解方法以减少任务对资源占用时间的需求;在此基础上建立了该问题的约束满足CSP调度模型;针对该模型变量多、解空间规模庞大的特点以及对求解算法时效性的要求,设计了一种基于局部解空间跳出机制的改进型遗传算法MGA.仿真表明该模型与算法在给定时间内能够得到满意的调度方案.     

On competitive analysis for polling systems

Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems.     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling and due‐date quotation in a make‐to‐order supply chain

We consider a manufacturer, served by a single supplier, who has to quote due dates to arriving customers in a make‐to‐order production environment. The manufacturer is penalized for long lead times and for missing due dates. To meet due dates, the manufacturer has to obtain components from a supplier. We model this manufacturer and supplier as a two‐machine flow shop, consider several variations of this problem, and design effective due‐date quotation and scheduling algorithms for centralized and decentralized versions of the model. We perform extensive computational testing to assess the effectiveness of our algorithms and to compare the centralized and decentralized models to quantify the value of centralized control in a make‐to‐order supply chain. Since complete information exchange and centralized control is not always practical or cost‐effective, we explore the value of partial information exchange for this system. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008