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     

铁酸镍和铁酸锰的制备及磁性对比

用化学共沉淀法在90℃的反应温度制备了NiFe2O4和MnFe2O4铁酸盐多晶微粉,发现经沉淀洗涤后直接得到MnFe2O4纳米微粉,不需热处理过程;而要获得NiFe2O4需要对沉淀洗涤后的前驱体进行热处理。利用振动样品磁强计测量了样品在室温下的磁性能,对两种磁粉的磁性进行了对比。     

Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Single machine parallel batch scheduling subject to precedence constraints

We consider the single machine parallel batch scheduling problems to minimize makespan and total completion time, respectively, under precedence relations. The complexities of these two problems are reported as open in the literature. In this paper, we settle these open questions by showing that both problems are strongly NP‐hard, even when the precedence relations are chains. When the processing times of jobs are directly agreeable or inversely agreeable with the precedence relations, there is an O(n²) time algorithm to minimize the makespan. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

泰氟隆烧蚀产物对电子密度的影响

采用WNND格式,对有泰氟隆烧蚀产物引射的化学非平衡NS方程进行了数值模拟。采用7组元纯空气化学反应和19组元、28种反应的空气—泰氟隆化学反应系统,对照计算了壁面有泰氟隆烧蚀产物引射和纯空气绕流两种流场,研究了泰氟隆烧蚀产物对电子密度的影响。     

基于改进核极限学习机和集成学习理论的目标机动轨迹预测

为了提高目标轨迹预测的精度以及预测模型的泛化能力,提出基于改进蝙蝠算法优化的核极限学习机(Kernel Extreme Learning Machine,KELM)和集成学习理论目标机动轨迹预测模型。构建KELM模型,并采用改进的蝙蝠算法对KELM的参数进行优化;以优化后的KELM神经网络为弱预测器,结合集成学习算法生成强预测器,通过训练不断优化强预测的结构和参数,得到一种基于集成学习理论的目标机动轨迹预测模型;基于不同规模的样本,将所得预测模型与逆传播神经网络、支持向量机和极限学习机等模型进行对比分析。仿真结果表明:所提目标机动轨迹预测模型具有较好的预测精度和泛化能力。     

Predicting intensive care unit bed occupancy for integrated operating room scheduling via neural networks

In a master surgery scheduling (MSS) problem, a hospital's operating room (OR) capacity is assigned to different medical specialties. This task is critical since the risk of assigning too much or too little OR time to a specialty is associated with overtime or deficit hours of the staff, deferral or delay of surgeries, and unsatisfied—or even endangered—patients. Most MSS approaches in the literature focus only on the OR while neglecting the impact on downstream units or reflect a simplified version of the real‐world situation. We present the first prediction model for the integrated OR scheduling problem based on machine learning. Our three‐step approach focuses on the intensive care unit (ICU) and reflects elective and urgent patients, inpatients and outpatients, and all possible paths through the hospital. We provide an empirical evaluation of our method with surgery data for Universitätsklinikum Augsburg, a German tertiary care hospital with 1700 beds. We show that our model outperforms a state‐of‐the‐art model by 43% in number of predicted beds. Our model can be used as supporting tool for hospital managers or incorporated in an optimization model. Eventually, we provide guidance to support hospital managers in scheduling surgeries more efficiently.     

Scheduling maintenance and semiresumable jobs on a single machine

The majority of scheduling literature assumes that the machines are available at all times. In this paper, we study single machine scheduling problems where the machine maintenance must be performed within certain intervals and hence the machine is not available during the maintenance periods. We also assume that if a job is not processed to completion before the machine is stopped for maintenance, an additional setup is necessary when the processing is resumed. Our purpose is to schedule the maintenance and jobs to minimize some performance measures. The objective functions that we consider are minimizing the total weighted job completion times and minimizing the maximum lateness. In both cases, maintenance must be performed within a fixed period T, and the time for the maintenance is a decision variable. In this paper, we study two scenarios concerning the planning horizon. First, we show that, when the planning horizon is long in relation to T, the problem with either objective function is NP-complete, and we present pseudopolynomial time dynamic programming algorithms for both objective functions. In the second scenario, the planning horizon is short in relation to T. However, part of the period T may have elapsed before we schedule any jobs in this planning horizon, and the remaining time before the maintenance is shorter than the current planning horizon. Hence we must schedule one maintenance in this planning horizon. We show that the problem of minimizing the total weighted completion times in this scenario is NP-complete, while the shortest processing time (SPT) rule and the earliest due date (EDD) rule are optimal for the total completion time problem and the maximum lateness problem respectively. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 845–863, 1999     

消防部队化学事故应急救援预案的制定与演习

阐述公安消防部队制定化学事故应急救援预案的程序、方法、步骤及制定预案时应考虑的各种因素;并对化学事故应急预案在不同条件下实施演习的程序、方法及演习过程中应注意的问题提出看法.     

局部放电在线监测电流传感器的等效电路及其参数计算

局部放电在线监测是保证电力设备正常工作的重要手段。从变压器理论出发 ,提出了局放脉冲电流传感器等效电路及其参数计算方法 ,所提出的方法已成功地应用于实际局放在线监测传感器的设计中