Scheduling research and the first decade of NRLQ: A historical perspective

It is generally recognized that the first model involving job scheduling was presented by Selmer Johnson and published in the inaugural issue of Naval Research Logistics Quarterly (NRLQ) in 1954. NRLQ also published another seminal scheduling paper by Wayne E. Smith a short time later. In the present paper, we discuss the contribution of NRLQ and the role of the Office of Naval Research in the development of the scheduling literature during the first decade (1954–1963). We also provide a critical analysis of the papers by Johnson and Smith. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 335–344, 2015     

On equivalence between the proportionate flow shop and single‐machine scheduling problems

We derive sufficient conditions which, when satisfied, guarantee that an optimal solution for a single‐machine scheduling problem is also optimal for the corresponding proportionate flow shop scheduling problem. We then utilize these sufficient conditions to show the solvability in polynomial time of numerous proportionate flow shop scheduling problems with fixed job processing times, position‐dependent job processing times, controllable job processing times, and also problems with job rejection. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 595–603, 2015     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

基于支持向量机的多元文本分类研究

根据文本分类的特点,在对最小二乘支持向量机方法进行详细分析的基础上,创建了基于最小二乘支持向量机的多元文本分类器.实验表明,采用该文本分类器能够在保持较高分类精度和召回率的基础上,提高训练效率,具有一定的可行性.     

平面磨削精度控制的一种方法

分析了利用砂轮周边进行平面磨削加工产生形状误差的原因之一。即待加工表面的形状变化引起磨削力的变化,从而引起工艺系统的弹性变形的变化,这种变形最终导致工件产生形状误差。提出了解决这一问题的技术途径和方法,即将待加工表面分解成若干小块,对每一小块根据其形状进行分析,找出其磨削力的变化规律,然后用程序控制工件速度,从而保持磨削力近似不变,并总结了应用该方法的步骤。举例说明了应用该方法所取得的结果是:磨削平面的精度提高到原来的5倍,加工时间缩短到约为原来的一半。     

电磁振动给料机的研究与制造

利用振动原理,研究、设计、制造微型电磁振动给料机（筛）．设计了激磁铁芯、半波可控硅整流及控制电路．在对振动机械的隔振分析及优化设计理论的基础上,设计了整部机器的结构图纸,并制造了一部样机,给出了振动利用的一个范例．所研究制造的微型电磁振动机集机电为一体,在焊接、制药等诸多行业中具有广泛的应用价值．     

机枪浮动技术研究

介绍了一种环形弹簧浮动机在大口径机枪上实现的可能性,说明了采用环形弹簧可以使大口径机枪获得浮动。建立了武器系统的动力学模型和目标函数,用优化设计的方法确定了环形弹簧的设计参数,并对某型高射机枪进行了动力分析。     

武器系统研制费投资分布规律的仿真研究

针对大型项目多峰、复杂费用分布的传统仿真建模方法模型选取过于复杂、且难以达到精度要求等不足,提出将一种基于支持向量机的机器学习方法应用于大型复杂武器系统研制费投资分布研究.计算结果表明,这种方法有效弥补了传统建模方法的缺陷,有更好的泛化能力和实用性,因而可以作为研究此类问题的一种新方法.     

A robust policy for serial agile production systems

One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A note on combined job selection and sequencing problems

We investigate the solvability of two single‐machine scheduling problems when the objective is to identify among all job subsets with cardinality k,1≤k≤n, the one that has the minimum objective function value. For the single‐machine minimum maximum lateness problem, we conclude that the problem is solvable in O(n²) time using the proposed REMOVE algorithm. This algorithm can also be used as an alternative to Moore's algorithm to solve the minimum number of tardy jobs problem by actually solving the hierarchical problem in which the objective is to minimize the maximum lateness subject to the minimum number of tardy jobs. We then show that the REMOVE algorithm cannot be used to solve the general case of the single‐machine total‐weighted completion time problem; we derive sufficient conditions among the job parameters so that the total weighted completion time problem becomes solvable in O(n²) time. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 449–453, 2013