舰载机多机一体化机务保障调度研究

针对舰载机多机一体化机务保障调度问题,以出树、入树的形式描述实际保障过程中并行工序的约束关系,以最大保障完工时间和资源负载均衡性为目标,构建了舰载机多机一体化机务保障非线性多目标混合流水车间调度模型,并设计了一种结合基于Insert的动态邻域爬山搜索策略和并行工序的同步化修正的Memetic算法求解该模型。最后通过实例仿真验证了模型和所提算法的可行性和有效性。     

Preemptive parallel‐machine scheduling with a common server to minimize makespan

We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017     

天基预警系统资源调度问题分析

在介绍天基预警系统作战流程,以及天基预警系统资源和任务的分析和描述的基础上,提出天基预警系统资源调度问题,给出其输入输出结构,并以五元组的形式对该问题进行形式化描述。 关键词：天基预警系统、资源调度、形式化描述     

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     

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     

资源不确定军事任务计划预测调度模型与算法

针对军事任务计划执行环境中普遍存在的资源不确定性,提出了基于资源缓冲区的军事任务计划预测调度算法。算法首先基于平台有效资源功能向量进行任务—平台分配,分配过程中通过调节平台有效资源功能向量,获得不同的平台资源缓冲区分配方案;然后基于NSGA-Ⅱ算法框架对军事任务计划进行多目标求解,进而获得问题的Pareto最优解集。文章通过仿真算例对算法的可行性和有效性进行验证,实验结果表明,该算法能够有效求解资源不确定军事任务计划问题。     

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     

某特种车辆TTCAN网络的静态调度设计

针对某特种车辆计算机控制系统对实时性的高要求,采用了TTCAN总线系统,为实现TTCAN系统的静态调度问题,提出了基于AL算法的改进算法——谐波周期算法,并通过MATLAB建立了系统的调度表。针对谐波周期算法的不足,结合该计算机控制系统的工作原理、信息传输的重要程度对静态调度表进行了适当的修改。通过与AL算法的对比分析,证实了改进的谐波周期算法在保证系统中周期型消息实时性能前提下,为非周期型信息获得了更大的传输带宽,又使系统信息传输的时间分配更加合理。     

Manpower allocation with time windows and job‐teaming constraints

In this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.