公安派出所消防监督工作面临的困难及对策

公安派出所应在辖区内进行消防监督检查是法定职能之一,也是加强社会消防安全监督检查,提高社会防御火灾事故能力,全面实现消防工作社会化的一条有效途径,它对弥补消防监督警力不足有着重要意义。分析目前派出所消防监督管理工作面临的问题,提出了改进和加强派出所消防监督管理工作的措施。     

消防部队基层干部心理问题分析与对策研究

消防部队基层干部面临个体需求与现实满足存在较大差距时出现的心理问题,受个体与周围环境因素的影响。面对心理问题,在重视部队传统教育的基础上,大胆借鉴现代企业管理经验和理念,充分利用压力的正效应,结合物质鼓励和精神激励,合理疏导,妥善处理。     

奇型抛物问题的有限元误差估计

本文引入带权的 Sobolev 空间,讨论了奇型线性问题:(?)((?)u)/((?)t)-1/x~(?)(x~aa(x)u′)′=f(t,x) (x,t)∈1×J(?)/((?)x)u(t,0)=u(t,1)=0 t∈Ju(0,x)=φ(x) x∈I式中 I=(0,1),J=[0,T],0<α<3的有限元方法,并在适当条件下,给出了最佳估计:‖u_(?)-u‖_(0,2,a)≤ch~2{‖φ‖_(2,2,a)+[integral 0 to t (‖u‖~2_(2,2,a)+‖u_(?)‖~2_(2,2,a)dt]~(1/2)}‖u_(?)-u‖_(1,2,a)≤ch~2{‖φ‖_(2,2,a)+[integral 0 to t (‖u‖~2_(2,2,a)+‖u_(?)‖~2_(2,2,a)dt]~(1/2)}     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998     

Two exact algorithms for the vehicle routing problem on trees

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time‐constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 75–89, 1999     

分物问题的分法数计算

r个物品分配到n个盒子中,在不同的条件下会有不同的分法数。本文讨论了不同条件下,分法数的计算方法。     

Capacitated warehouse location model with risk pooling

In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Analysis of a machine repair problem with an unreliable server and phase type repairs and services

In this paper we study a machine repair problem in which a single unreliable server maintains N identical machines. The breakdown times of the machines are assumed to follow an exponential distribution. The server is subject to failure and the failure times are exponentially distributed. The repair times of the machine and the service times of the repairman are assumed to be of phase type. Using matrix‐analytic methods, we perform steady state analysis of this model. The time spent by a failed machine in service and the total time in the repair facility are shown to be of phase type. Several performance measures are evaluated. An optimization problem to determine the number of machines to be assigned to the server that will maximize the expected total profit per unit time is discussed. An illustrative numerical example is presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 462–480, 2003     

满足线性二次型调节器性能指标的群系统编队跟踪问题优化控制方法

针对群系统编队跟踪问题,提出一种满足线性二次型调节器性能指标的优化控制方法。建立编队跟踪问题的数学描述和设计编队跟踪控制协议。给出群系统实现编队跟踪的充要条件,借助李雅普诺夫第二方法分析系统的稳定性。得到了控制协议能够最小化线性二次型调节器性能指标的拓扑条件,设计了编〖BHDWG8,WK10YQ,DK1*2,WK1*2D〗〖XCWL.TIF;%129%129〗听语音 聊科研与作者互动 队跟踪算法。仿真实验验证了控制方法的有效性。     

The burglar problem with multiple options

We consider the burglar problem in which a burglar can either retire or choose among different types of burglaries, with each type having its own success probability and reward distribution. Some general structural results are established and, in the case of exponentially distributed reward distributions, a solution technique is presented. The burglar problem's relationship to a stochastic knapsack problem with a random exponentially distributed knapsack capacity is shown. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 359–364, 2014