兵力展开问题研究

如何将基地的兵力以最短时间展开到多个阵地中,是运输问题中的一种。为解决此问题对著名的兵力展开问题进行了研究。建立了兵力展开问题的数学模型,此模型是一个混合整数规划模型。提出了一种求解方法,该方法可解决类似的混合整数规划问题。最后给出了一个实例。     

成败型产品的Bayes鉴定试验方案研究

利用可靠性增长模型给出了成败型产品鉴定试验的一种Bayes方法.提出了Bayes鉴定试验的最大后验风险准则,利用这种准则制定的鉴定试验方案综合了产品研制过程中的先验信息.在确保产品质量的前提下,与传统的鉴定试验方案相比,将大大节省试验时间.     

公众聚集场所消防监督管理存在问题及对策

近年来 ,我国公众聚集场所群死群伤恶性火灾时有发生 ,原因固然是多方面的 ,但是 ,公众聚集场所在监督和管理两个层面上存在的突出问题和薄弱环节 ,不能不引起我们的高度重视。结合多年来开展消防监督工作的实践 ,从消防法律法规、消防安全管理体制、技术标准等方面分析了公众聚集场所消防安全监督管理存在的问题 ,并提出了相应对策措施。     

大学生问题行为及对策浅析

本文从心理学的角度分析了大学生常见的问题行为,对问题行为的性质、外部表现、心理特征及应对措施作了详尽分析,集中讨论了人格不适、失恋、考试焦虑及人格障碍等方面的问题,以期有助于大学生问题行为的处理。     

混合指数分布模型的Bayes分析

针对截尾试验数据的情况,给出了二元混合指数分布模型的平均寿命和可靠性函数的严格的Ｂａｙｅｓ点估计,并运用最大熵准则给出了可靠性函数的近似的Ｂａｙｅｓ置信下限估计。     

The bottleneck problem with minimum quantity commitments

Given an edge‐distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introduce minimum quantity commitments to balance workloads of suppliers, provide the best possible approximation algorithm, and study its generalizations and specializations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

The impact of manufacturer rebates on supply chain profits

Manufacturer rebates are commonly used as price discount tools for attracting end customers. In this study, we consider a two‐stage supply chain with a manufacturer and a retailer, where a single seasonal product faces uncertain and price‐sensitive demand. We characterize the impact of a manufacturer rebate on the expected profits of both the manufacturer and the retailer. We show that unless all of the customers claim the rebate, the rebate always benefits the manufacturer. Our results thus imply that “mail‐in rebates,” where some customers end up not claiming the rebate, particularly when the size of the rebate is relatively small, always benefit the manufacturer. On the other hand, an “instant rebate,” such as the one offered in the automotive industry where every customer redeems the rebate on the spot when he/she purchases a car, does not necessarily benefit the manufacturer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A branch‐and‐price algorithm for a targeting problem

In this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch‐and‐price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy‐style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Flexibility and complexity in periodic distribution problems

In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

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