A heuristic for maximizing the number of on‐time jobs on two uniform parallel machines

We consider the problem of maximizing the number of on‐time jobs on two uniform parallel machines. We show that a straightforward extension of an algorithm developed for the simpler two identical parallel machines problem yields a heuristic with a worst‐case ratio bound of at least . We then show that the infusion of a “look ahead” feature into the aforementioned algorithm results in a heuristic with the tight worst‐case ratio bound of , which, to our knowledge, is the tightest worst‐case ratio bound available for the problem. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

案例教学法在工业企业防火教学中的应用

工业企业防火课程具有较强的理论知识性和实践应用性，其教学必须体现理论讲授为主导，实践应用为主体的教学指导思想。而传统的教学方法不能真正实现师生互动，无法培养学生学习的主动性和创造性。为弥补传统教学模式中存在的缺陷，将案例教学法引入工业企业防火课堂教学中，取得了良好的教学效果。     

尾流自导鱼雷直进射击系统误差的提前角修正方法

针对尾流自导鱼雷直进射击方式下弹道简化产生的命中结果系统误差问题,采用几何分析法,首先,分析了尾流自导鱼雷的直进射击原理;然后,依据尾流自导鱼雷弹道过程,建立了尾流自导鱼雷命中点偏差的解析计算模型,并分析了该偏差对鱼雷命中效果的影响;最后,研究了消除该系统误差的提前角修正方法。通过实例论证了该修正方法的可行性和有效性。     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016     

Bin‐packing problem with concave costs of bin utilization

We consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst‐case performances when they are applied to our model. The absolute worst‐case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Analysis of practical policies for a single link distribution system

In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency‐based periodic shipping (FBPS) policies. We show that, in the worst‐case, the Best ZIO policy has a performance ratio of . A better performance guarantee of is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

抢险救援课程中的案例教学

本文介绍了案例教学的基本概念,并对案例教学在抢险救援课程中的应用进行了探讨,提出了在抢险救援课程中开展案例教学的实施方法和存在的不足,同时指出对案例教学应有一个正确的认识。     

案例教学及其在《心理咨询》课程教学中的运用

案例教学是当代一种很有发展潜力的教学模式。本文阐述了案例教学的起源、案例的特性,以及案例教学在《心理咨询》教学中运用和应注意的问题。     

固相微萃取技术及其在毒剂分析中的应用

综述了固相微萃取的装置,原理、发展及其在毒剂分析中的应用．     

基于虚拟现实技术的案例式反恐指挥训练

本文探讨将虚拟现实技术引入案例式反恐指挥训练，首先分析基于虚拟现实技术案例式指挥训练的理论依据；对案例式VR反恐指挥训练的流程进行设计，并确定案例式VR反恐指挥训练内容；对训练中应把握的原则进行了明确，研究创新部队指挥训练形式具有参考价值。