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     

威布尔比例风险模型装备状态维修检测间隔期研究

针对装备的实际寿命受到多种复杂因素影响的情况,以威布尔比例风险模型为基础,建立了反应装备状态的可靠度模型,针对传统参数估计方法的不足,提出了利用遗传算法进行模型参数估计的方法。同时,利用主成分分析法,保证原始数据信息损失最小的情况下,以少数的综合变量取代原有的多维变量,简化了状态参数。以故障风险为决策目标,建立了状态维修检测间隔期决策模型。通过实例,验证了该方法的可行性和有效性。     

改进熵系数法的预警机探测引导能力评估

引入欧氏距离来度量基于离差最大化法与熵系数法确定的两个权重向量的相似度,在相似度最大约束条件下,确定了熵系数法中参数ρ值,解决了参数ρ取值人为主观性的问题。采用区间数来表示专家对指标间的相对重要性,克服了实际中难于得到准确决策信息的问题。将区间数特征向量法确定的主观权重和改进的熵系数法确定的客观权重集成得到组合权重,采用加权算术平均算子对4种预警机的探测引导能力进行了计算。     

保证率点值区间估计的Monte-Carlo方法

提出了一种根据实测样本系列对保证率点值进行区间估计的Ｍｏｎｔｅ─Ｃａｒｌｏ方法。对于具有正态分布或对数正态分布的样本,首先推出总体参数的分布,然后用Ｍｏｎｔｅ─Ｃａｒｌｏ法生成总体参数系列,据此求得相应的保证率点值系列,最后通过经验分布推得在给定置信度下保证率点值的区间估计,本文还给出了一个算例。     

改进的精密三点法——在线测量直线度方法的再探讨

在原精密三点法的基础上,对插值方法进行了改进,对随机误差采用了相应的数据处理方法,使得分离结果更加接近真实值,并有效地去除了随机误差的影响,得到了采样值加密的曲线,文中给出了改进的精密三点法的算法和流程图。从仿真和实验结果来看,该方法是具有可行性和可靠性的。     

基于灰色预测的时敏军事任务调度模型

为有效利用栅格化军事信息系统硬件冗余资源,提高系统运行时效,保证时敏军事任务执行效果,基于灰色理论的GM(1,1),提出了一种时敏军事任务调度模型。构建了基于主动式主/副本机制的调度流程,并针对普通(阈值)调度模型和模糊控制调度模型中调度触发的滞后和调度价值不确定的问题,设计了预测型调度时间窗口,有效优化了调度触发机制。最后通过仿真实验,考察了3种调度模型的有效性,结果表明模型虽然耗费了较大的调度开销,但在降低总体任务用时上作用明显。     

Multiproduct batching and scheduling with buffered rework: The case of a car paint shop

We study a problem of scheduling products on the same facility, which is motivated by a car paint shop. Items of the same product are identical. Operations on the items are performed sequentially in batches, where each batch is a set of operations on the same product. Some of the produced items are of the required good quality and some items can be defective. Defectiveness of an item is determined by a given simulated function of its product, its preceding product, and the position of its operation in the batch. Defective items are kept in a buffer of a limited capacity, and they are then remanufactured at the same facility. A minimum waiting time exists for any defective item before its remanufacturing can commence. Each product has a sequence independent setup time which precedes its first operation or its operation following an operation of another product. A due date is given for each product such that all items of the same product have the same due date and the objective is to find a schedule which minimizes maximum lateness of product completion times with respect to their due dates. The problem is proved NP‐hard in the strong sense, and a heuristic Group Technology (GT) solution approach is suggested and analyzed. The results justify application of the GT approach to scheduling real car paint shops with buffered rework. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 458–471, 2014     

Multidirectional scheduling scheme in resource‐constrained project schedulingproblem

In 2000, Klein showed that bidirectional scheduling schemes (bidss) outperform single‐directional scheduling schemes (e.g., forward or backward schemes). In 2010, Yoosefzadeh, et al. [J Math Model Algor 9 (2010), 357–373] showed that depending on the nature of the problems and also the type of priority rules used, schedules produced by a so‐called tridirectional scheduling scheme (trdss) yields shorter makespans when compared to forward, backward, and even bidss. Since the justification technique is applied in many of the state‐of‐the‐art algorithms nowadays, we show that the tuned version of the trdss outperforms the double justification technique. Moreover, we investigate the circumstances under which the trdss is more probable to generate schedules with shorter makespans. To this end, we introduce a new measure of resource requirements and their distributions, namely total amount of overflows. Our analytical as well as empirical investigations show that when the new measure is increased, it is more probable to obtain schedules with shorter makespans using the trdss. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 44–55, 2014     

Lot streaming with supplier–manufacturer coordination

Lot splitting refers to breaking a production lot into smaller sublots during production. Coordinating lot splitting decisions across multiple stages of a production process is a challenging task. Traditional lot splitting and lot streaming models implicitly assume that the entire system is operated and owned by the same firm, or there exists a coordinator who controls the operation of all machines in the system. In this paper, we consider the situation where the machines in a multiple‐stage production process are owned and managed by different companies. Every item in a given production lot has to go through the processing by the supplier's machine, followed by the manufacturer's machine, and so on. We develop and analyze coordination mechanisms that enable different parties in the supply chain to coordinate their lot splitting decisions so as to achieve a systemwide optimum. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Reformulating linear programs with transportation constraints—With applications to workforce scheduling

We study linear programming models that contain transportation constraints in their formulation. Typically, these models have a multistage nature and the transportation constraints together with the associated flow variables are used to achieve consistency between consecutive stages. We describe how to reformulate these models by projecting out the flow variables. The reformulation can be more desirable since it has fewer variables and can be solved faster. We apply these ideas to reformulate two well‐known workforce staffing and scheduling problems: the shift scheduling problem and the tour scheduling problem. We also present computational results. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.