JD-5W型电磁计程仪的研制

本文介绍了采用微处理机技术的JD-5W型电磁计程仪的基本工作原理、硬件组成及程序设计。该仪器不但结构简单、解算与传送精度高、接口功能齐全,而且在测速校正过程中能自动完成数据处理与误差修正,解决了计程仪使用过程中测速校正困难的问题。     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

加强教育成本核算提高武警院校办学效益

随着社会主义市场经济的不断发展和武警院校管理体制改革的逐步深入,武警院校应加强教育成本核算,立足于现有的经费、资源,精打细算,通过认真的成本核算,优化资源配置,提高办学质量和经费使用效益。     

Scheduling recurrent construction

A problem we call recurrent construction involves manufacturing large, complex, expensive products such as airplanes, houses, and ships. Customers order configurations of these products well in advance of due dates for delivery. Early delivery may not be permitted. How should the manufacturer determine when to purchase and release materials before fabrication, assembly, and delivery? Major material expenses, significant penalties for deliveries beyond due dates, and long product makespans in recurrent construction motivate choosing a release timetable that maximizes the net present value of cash flows. Our heuristic first projects an initial schedule that dispatches worker teams to tasks for the backlogged products, and then solves a series of maximal closure problems to find material release times that maximize NPV. This method compares favorably with other well‐known work release heuristics in solution quality for large problems over a wide range of operating conditions, including order strength, cost structure, utilization level, batch policy, and uncertainty level. Computation times exhibit near linear growth in problem size. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

军用航空机务维修人员安全知识结构评价研究

随着军用航空装备复杂性、安全性的提升,对广大机务维修人员安全知识结构提出了更高的要求。以某机务部队现状为依据,研究航空机务维修人员安全知识结构评价问题。利用工作分析法对航空机务维修人员的工作进行了深入分析,建立了航空机务维修人员安全知识结构指标体系,通过构建基于熵权的改进BP神经网络模型对建立的知识体系结构进行评价。以某单位实际调研数据为基础,利用MATLAB仿真实现了模型的训练和测试,对机务维修人员的安全知识结构进行量化分析,为机务人员的安全知识能力培养提供决策依据和参考。     

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     

Optimal job splitting on a multi‐slot machine with applications in the printing industry

In this article, we define a scheduling/packing problem called the Job Splitting Problem, motivated by the practices in the printing industry. There are n types of items to be produced on an m‐slot machine. A particular assignment of the types to the slots is called a “run” configuration and requires a setup cost. Once a run begins, the production continues according to that configuration and the “length” of the run represents the quantity produced in each slot during that run. For each unit of production in excess of demand, there is a waste cost. Our goal is to construct a production plan, i.e., a set of runs, such that the total setup and waste cost is minimized. We show that the problem is strongly NP‐hard and propose two integer programming formulations, several preprocessing steps, and two heuristics. We also provide a worst‐case bound for one of the heuristics. Extensive tests on real‐world and randomly generated instances show that the heuristics are both fast and effective, finding near‐optimal solutions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Equivalent accelerated life testing plans for log‐location‐scale distributions

Accelerated life testing (ALT) is widely used to determine the failure time distribution of a product and the associated life‐stress relationship in order to predict the product's reliability under normal operating conditions. Many types of stress loadings such as constant‐stress, step‐stress and cyclic‐stress can be utilized when conducting ALT. Extensive research has been conducted on the analysis of ALT data obtained under a specified stress loading. However, the equivalency of ALT experiments involving different stress loadings has not been investigated. In this article, a log‐location‐scale distribution under Type I censoring is considered in planning ALT. An idea is provided for the equivalency of various ALT plans involving different stress loadings. Based on this idea, general equivalent ALT plans and some special types of equivalent ALT plans are explored. For demonstration, a constant‐stress ALT and a ramp‐stress ALT for miniature lamps are presented and their equivalency is investigated. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

作业名层次化聚类算法预测作业运行时间

预测作业的运行时间有益于提升系统的调度性能,而聚类有助于训练出更好的预测模型。传统的聚类算法很难将相似的作业名聚类,为了将相似的作业更好地聚类,通过分析其组成成分的语义重要性,构建字母-结构-数字的作业名层次化聚类算法。以两台超级计算机的真实数据为例,实验结果发现,应用此算法聚类后的数据训练模型的预测精度相较传统方法有一定的提升,整体预测精度为70%～80%。     

基于XBRL技术的武警财务会计报告研究

分析了武警部队运用XBRL技术的必要性和可行性。针对武警部队网络财务会计报告模式,构建了基于XBRL技术的武警部队财务会计报告的模型,并提出建议。