A Markovian model for process setup and improvement

We examine the setup and improvement policies for a production process with multiple performance states. Assume that the production process deteriorates randomly over time, following a Markovian process with known transition probabilities. In order to reduce the production cost incurred because of process deterioration, the process is inspected at the end of each period. Then one of three actions may be taken: do nothing, perform routine process setup, or perform routine setup and process improvement. The routine setup operation returns the process to its best performance state, whereas the process improvement action may reduce future production and setup costs and improve the process-state transition probabilities. A discounted Markovian model is formulated to find the strategy that minimizes the total cost of operating the production process. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 383–400, 1997     

Exact bayesian estimation of system reliability from component test data

System reliability is often estimated by the use of components' reliability test results when system test data are not available, or are very scarce. A method is proposed for computing the exact posterior probability density function, cumulative distribution function, and credible intervals for system reliability in a Bayesian setting, with the use of components' prior probability distributions and current test results. The method can be applied to series, parallel, and many mixed systems. Although in theory the method involves evaluating infinite series, numerical results show that a small number of terms from the infinite series are sufficient in practice to provide accurate estimates of system reliability. Furthermore, because the coefficients in the series follow some recurrence relations, our results allow us to calculate the reliability distribution of a large system from that of its subsystems. Error bounds associated with the proposed method are also given. Numerical comparisons with other existing approaches show that the proposed method is efficient and accurate. © 1997 John Wiley & Sons, Inc.     

截顶圆锥薄壳振动特性的计算

用有限单元法计算,单元为轴对称截锥壳。法向位移函数w 和周向位移函数v 采用三次多项式,纵向位移函数u 为线性多项式。其节圆自由度选取节圆上三个位移,一个转角和一个剪应变。计算结果与文献[1]、[2]和[3]作了比较。这方法和程序可以应用于计算截顶圆锥壳的振动特性。     

确立与建设信息化部队相适应的思想观念

积极推进中国特色军事变革 ,领导干部必须牢固确立与建设信息化部队相适应的思想观念 :其一 ,信息化战争正逐步取代机械化战争 ;推进中国特色军事变革 ,必须确立信息化是我军现代化建设“主要目标”的观念。其二 ,信息化战争中信息居于整个作战体系的中枢 ;建设信息化部队 ,必须确立信息力是“第一战斗力”的观念。其三 ,信息化战争实质上是人的知识技能的较量 ;建设信息化部队 ,必须确立人才是“第一资源”的观念。其四 ,信息化战争是诸军兵种一体化的联合作战 ;建设信息化部队 ,必须确立搞好顶层设计、促进全面协调发展是“第一要求”的观念     

碳化硼涂覆的碳纤维的抗热氧化性研究

用自己合成的裂解能得到碳化硼的聚碳硼烷,对碳纤维进行涂层,并详细测试了涂层碳纤维的抗热氧化性能。     

Modeling and solution for the ship stowage planning problem of coils in the steel industry

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015     

钢质管道挤压变形实验研究与结果分析

野外埋地敷设的长距离输油管道发生断裂等较大破坏时,采用管道局部挤压的方式,在较短时间内将管道快速压扁以截断流油。为了设计管道挤压截流装置,使用18 mm宽度的压头对?325 mm×6 mm的X60钢管进行挤压变形实验,得到了管道挤压的载荷-位移曲线、管道的变形范围、管道压扁后的回弹情况和挤压过程中的塑性载荷等数据,并验证了管道挤压过程中的安全性。通过实验,不仅可以研究管道塑性破坏后的变形规律,而且为管道泄漏抢修提供了理论和实践参考。     

径向载荷作用下管道挤压变形过程数值模拟

野外埋地敷设的长距离输油管道发生断裂等较大事故时,采用管道局部挤压的方式可以在较短时间内将管道快速压扁以截断流油。为设计管道挤压截流装置,运用ANSYS Workbench建立上下压头加载作用下管道挤压的有限元模型,完成对ф159 mm×5 mm的45号钢挤压变形模拟仿真,得到管道挤压的等效应力、位移分布、变形范围和载荷-位移曲线等。将模拟数据与实验数据进行对比,两者结果比较吻合,可以为管道泄漏抢修提供理论和实践参考。     

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     

耐海水高耐候丙烯酸树脂的合成及面漆性能分析

为合成耐海水与高耐候的丙烯酸树脂,选择甲基丙烯酸甲酯、甲基丙烯酸羟丁酯、丙烯酸异辛酯和丙烯酸已内酯,经引发剂作用,采用同步滴加法进行聚合反应,通过调节温度并测定酸价控制反应历程,并将合成的不同玻璃化温度的丙烯酸树脂配制成具有适当玻璃化温度梯度的耐海水面漆成膜树脂体系。选择HDT-90固化剂与丙烯酸成膜树脂作用,制备耐海水面漆涂层样品。性能测试结果表明,研制的耐海水面漆具有优良的耐候性和抗老化性。