批量独立可修件的备件需求预测仿真算法

利用Monte Carlo随机仿真技术,采用事件调度法的仿真策略对可修件的使用与维修过程进行仿真,给出了在给定备件和维修分队数量下批量独立可修件的备件保障概率仿真算法,并用一系列计算实例证明了算法的可行性和正确性,该算法能有效解决安装在不同装备上,具有不同已工作时间、不同故障间隔时间分布、不同修复时间分布的可修件的备件保障概率计算问题,为备件的科学储备提供了有力的决策依据。     

Machine scheduling with an availability constraint and job delivery coordination

In this paper we study the scheduling problem that considers both production and job delivery at the same time with machine availability considerations. Only one vehicle is available to deliver jobs in a fixed transportation time to a distribution center. The vehicle can load at most K jobs as a delivery batch in one shipment due to the vehicle capacity constraint. The objective is to minimize the arrival time of the last delivery batch to the distribution center. Since machines may not always be available over the production period in real life due to preventive maintenance, we incorporate machine availability into the models. Three scenarios of the problem are studied. For the problem in which the jobs are processed on a single machine and the jobs interrupted by the unavailable machine interval are resumable, we provide a polynomial algorithm to solve the problem optimally. For the problem in which the jobs are processed on a single machine and the interrupted jobs are nonresumable, we first show that the problem is NP‐hard. We then propose a heuristic with a worst‐case error bound of 1/2 and show that the bound is tight. For the problem in which the jobs are processed on either one of two parallel machines, where only one machine has an unavailable interval and the interrupted jobs are resumable, we propose a heuristic with a worst‐case error bound of 2/3. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Basic scheduling problems with raw material constraints

One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement of standard practice. Availability of raw materials, however, which is another important constraint in practice, has been largely disregarded in scheduling theory. This paper considers basic models for scheduling problems in contemporary manufacturing settings where raw material availability is of critical importance. We explore single scheduling machine problems, mostly with unit or all equal processing times, and L_max and C_max objectives. We present polynomial time algorithms, complexity and approximation results, and computational experiments. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Properties of the geometric and related processes

Some properties of the geometric process are studied along with those of a related process which we propose to call the α‐series process. It is shown that the expected number of counts at an arbitrary time does not exist for the decreasing geometric process. The decreasing version of the α‐series process does have a finite expected number of counts, under certain conditions. This process also has the same advantages of tractability as the geometric process; it exhibits some properties which may make it a useful complement to the increasing geometric process. In addition, it may be fit to observed data as easily as the geometric process. Applications in reliability and stochastic scheduling are considered in order to demonstrate the versatility of the alternative model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于时间序无圈有向图的多准则优化成像调度

合理有效地利用遥感卫星资源获取更多高质量影像数据是卫星成像调度的重要工作。提出了一种新的成像调度解决方案。应用图论相关理论,建立卫星成像时间序无圈有向图模型,利用多项准则作为衡量标准对不同成像路径进行评价,提出时间序多准则最短路径算法求取优化成像路径。理论分析和实验表明,该解决方案可以在较短时间内获得多条pareto优化成像路径,具有良好的调度性能。     

基于统计性QoS保证的数据包延时界调度算法

讨论了调度算法的性能指标,对目前基于业务流的调度算法的技术特点与性能优劣进行了分析和比较.重点研究了基于时延和丢包率的算法,并提出了一种基于数据包延时界(PDB)排列的调度策略,与WFQ及传统EDF算法进行了比较,证明业务端到端超时概率随网络带宽利用率的变化性能优于传统EDF算法.     

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

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

一种应用于数据通道综合的定向搜索流水调度算法

流水调度是专用数字信号处理器高层综合中一个困难而急待解决的问题。给出了一种定向搜索流水调度算法 ,目标是使全面考虑了运算单元、寄存器和互连的硬件代价最小化。它作为一种利用启发信息的迭代算法 ,一方面克服了确定性算法爬峰能力差、易于陷于局部极值的缺点 ,另一方面启发信息的利用加快了搜索过程。典型设计实例显示算法性能达到或超过了目前流水调度文献报道的最好性能