Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014     

基于非负矩阵分解的电磁超声系统优化研究

针对孤立脉冲群电磁超声系统信号特征容易被噪声淹没的问题,提出基于改进的非负矩阵分解（INMF）优选特征的支持向量机（SVM）方法．首先,用3种不同的方法提取高维特征;其次,用NMF方法实现特征降维,并保证降维结果的唯一性,避免对特征的直接选择;最后,应用支持向量机方法对降维特征进行分类．对孤立脉冲群电磁超声系统采集的4种信号特征进行提取、选择和分类,实验结果表明：INMF方法能有效提取微弱信号的特征,减少运算量,提高电磁超声系统特征采集的准确率．     

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     

火炮发射药装药自动识别方法

发射装药号是影响火炮身管寿命的重要因素,为自动识别火炮发射药的装药号,避免人工记录失误和完善火炮射弹履历,分析了装药号自动识别原理,运用火炮动力学分析理论和ADAMS虚拟样机技术,建立火炮发射动力学虚拟样机.通过仿真试验获取样本数据,应用BP神经网络进行学习和训练,从而建立装药号和测试数据之间的非线性映射关系,实现对火炮发射装药号的精确预测.     

虚拟维修仿真数据编辑系统研究

为有效解决虚拟维修系统中仿真数据编辑技术不通用的问题,在深入研究虚拟维修数据模型、交互任务分析、仿真数据管理等关键技术的基础上,设计开发了具有工程应用价值的虚拟维修仿真数据编辑系统.在分析系统设计需求的基础上,设计了系统总体结构,基于S1000D设计了虚拟维修数据模型,基于UML分析了维修样机编辑和维修规程编辑过程中的交互任务,基于XML实现了仿真数据的编辑、存储与发布.该系统应用于某型复杂装备虚拟维修,验证了系统的各项功能和应用效果.     

虚拟战场的实时四声道立体声合成

面向虚拟战场提出了实现实时四声道立体声合成的简化算法。针对四声道立体声的特殊性 ,首先探讨了四声道立体声系统中扬声器的配置方案。在四声道立体声系统扬声器配置方案的基础上 ,解决了单声源的表示、声强衰减及实时立体声化问题 ,然后提出一种评价混声效果的标准及一个评价声源对整个声音所作贡献的公式 ,并由此提出一个混声公式 ,从而解决了多声源环境的实时混声问题。该套算法用于应用系统 ,取得了较好的效果。     

一种基于多目标微粒群优化的虚拟网络映射方法

针对多个虚拟网络同时映射时资源统一优化分配的问题,提出了一种基于多目标微粒群优化的虚拟网络映射方法(MSC-VNE),提高底层网络资源利用率及全局负载均衡性能。建立了虚拟网络映射的多目标优化模型,将单个虚拟网络映射作为一个子群,并采用多子群协作优化的方法在子群映射时通过相互信息交换进行协同进化,最终达到全局资源的优化分配。仿真结果表明,与典型成果相比,提出的方法有效地提高了底层网络资源利用率和虚拟网络构建成功率。     

An FPTAS for scheduling a two‐machine flowshop with one unavailability interval

We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n⁵/ε⁴) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Proactive release procedures for just‐in‐time job shop environments,subject to machine failures

In this paper, we consider just‐in‐time job shop environments (job shop problems with an objective of minimizing the sum of tardiness and inventory costs), subject to uncertainty due to machine failures. We present techniques for proactive uncertainty management that exploit prior knowledge of uncertainty to build competitive release dates, whose execution improves performance. These techniques determine the release dates of different jobs based on measures of shop load, statistical data of machine failures, and repairs with a tradeoff between inventory and tardiness costs. Empirical results show that our methodology is very promising in comparison with simulated annealing and the best of 39 combinations of dispatch rules & release policies, under different frequencies of breakdowns. We observe that the performance of the proactive technique compared to the other two approaches improves in schedule quality (maximizing delivery performance while minimizing costs) with increase in frequency of breakdowns. The proactive technique presented here is also computationally less expensive than the other two approaches. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

分布虚拟战场环境CGF行为调度

提出了一种分布虚拟战场环境中计算机生成兵力(CGF)实体行为调度方法,该方法由仿真结点对结点中运行的所有本地CGF实体及异地实体的远程模型所产生的行为进行集中式调度。通过本地CGF实体的兴趣域动态决定需要执行的异地实体远程模型行为的优先级及执行最后时限,通过将本地所有CGF实体的兴趣域合并,减少仿真结点需要调度的异地实体远程模型数量,进一步降低仿真结点的计算开销。该方法可以有效地确保分布虚拟战场环境对仿真实时性及真实性的要求。