Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016     

A note on efficient sequences with respect to total flow time and number of tardy jobs

For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016     

频率匹配准则的某型机枪自动机结构参数优化

首先分析了影响某型重机枪射击精度的影响因素,并以武器频率匹配准则为依据,以建立的机枪动力学虚拟样机模型为平台,通过灵敏度分析,找出导气孔横截面积、活塞的有效横截面积、枪机框质量、枪机质量和枪机框缓冲簧刚度等参数是影响武器射击频率的主要因素;利用序列二次规划优化方法对自动机结构参数进行优化,优化仿真结果表明,武器的射向一致性得到明显提高,这对于武器结构方案优化设计,提高武器射击精度是至关重要的。     

小子样多失效模式系统可靠性竞争模型

为解决小子样多失效模式系统可靠性模型参数的估计问题,首先应用支持向量积建立小子样条件下各故障模式的规律模型,其次利用模型将各故障模式的故障数据由小子样扩充成大样本,再次采用常规的参数估算方法估算各故障模式的分布参数,最后建立多失效模式系统的可靠性竞争模型。利用所提方法,建立了小子样条件下具有两种失效模式的柴油机汽缸套可靠性竞争模型,计算结果与大样本条件下的故障预测数据吻合度较高,说明了方法的有效性。     

Linear compound algorithms for the partitioning problem

For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S₁ and S₂ such that the sum of elements in S₁ is equal to the sum of elements in S₂. If additionally two elements (the kernels) r₁, r₂ ∈ S are given which must not be assigned to the same set S_i, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000     

空空协同作战指挥控制系统

论述了研究与发展空空协同作战指挥系统的必要性 ,探讨了空空协同作战指挥系统的概念及系统的建模、结构模式 ,指挥决策的制定与优化、人机关系的处理、作战效能的评估与通讯共享集等几个问题     

Multiple common due dates

Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001     

A heuristic for the two‐machine no‐wait openshop scheduling problem

In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999     

近似推理在水雷参数分析专家系统中的应用

为了尽快分析出未知水雷障碍参数,根据水雷战的特点,提出了建立未知水雷障碍参数分析专家系统的观点,对专家系统的设计方法进行了一定的探讨,并针对专家系统建立中的"瓶颈"问题,提出了基于Vague集插值近似推理的专家系统知识自动获取方法,在介绍推理过程的基础上给出了算例.从推理的结果来看,该方法具有较高的可信度,从而为专家系统的研制提供了一定的方法支持.     

Openshop scheduling under linear resources constraints

Consider n jobs (J₁, …, J_n), m working stations (M₁, …, M_m) and λ linear resources (R₁, …, R_λ). Job J_i consists of m operations (O_i1, …, O_im). Operation O_ij requires P_k(i, j) units of resource R_k to be realized in an M_j. The availability of resource R_k and the ability of the working station M_h to consume resource R_k, vary over time. An operation involving more than one resource consumes them in constant proportions equal to those in which they are required. The order in which operations are realized is immaterial. We seek an allocation of the resources such that the schedule length is minimized. In this paper, polynomial algorithms are developed for several problems, while NP-hardness is demonstrated for several others. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 51–66, 1998