The concept of logistics derived from Clausewitz: All that is required so that the fighting force can be taken as a given

This article assesses the existing literature on logistics in war, concluding that there is no satisfactory conceptual definition of logistics. It proposes a concept of logistics derived from Clausewitz's theory of war to fill that void. This is presented as a derivation because Clausewitz's distinction between (1) the use of the fighting forces (tactics and strategy) and (2) all other activities in war that were required so that forces could be taken as a given. The latter, left unnamed by Clausewitz, corresponds to a concept of logistics that proves to be an analytical peer to Clausewitz's categories of politics, tactics and strategy.     

基于模糊语言对军事物流效益评估的多属性决策

军事物流是影响军事行动成败的重要因素,军事物流的效益与部队战斗力的形成与再生密切相关．为了更好的对军事物流效益进行评估,对于评估指标属性值,利用三角模糊数进行定量表示,结合离差最大化原理对三角模糊属性值的主客观权重进行修正．接着,利用多属性决策中的TOPSIS方法对军事物流效益进行评估．最后,结合实例说明该方法综合考虑主客观因素,有助于进行军事物流方案的选择,有效降低指挥员决策的主观随意性．     

Synchronization in hub terminals with the circular arrangement problem

Hub terminals are important entities in modern distribution networks and exist for any transportation device, that is, cross docks and parcel distribution centers for trucks, container ports for ships, railway yards for trains, and hub airports for aircraft. In any of these hubs, the mid‐term planning task of synchronizing the transshipment of goods and passengers when servicing the transportation devices has to be solved, for which many different solution approaches specifically tailored to the respective application exist. We, however, take a unified view on synchronization in hubs and aim at a general building block. As a point of origin, a basic vertex ordering problem, the circular arrangement problem (CAP), is identified. We explain the relation between the CAP and hub processes, develop suited algorithms for solving the CAP, and extend the basic CAP by multiple additions, for example, arrival times, limited storage space, and multiple service points, make the problem adaptable to a wide range of hub terminals. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 454–469, 2015     

军事虚拟仓库应急保障仿真分析

在分析应急物流研究成果基础上,探索应用虚拟仓库理论和仿真技术研究应急物流中的协同库存问题.为此,构建了军事虚拟仓库系统及其协同控制系统动力学仿真模型,并针对军民、军军仓库间的应急物流协同保障策略进行仿真分析,结果表明这种方法可以在应急状态下合理调度和管理各类仓库资源,改进应急物流条件下仓库保障能力.     

着眼综合大学建设目标，加强“物流工程”学科领域建设

建设综合性大学需要在广泛的领域建设高水平的学科,以不同模式培养高质量人才.通过分析开展物流工程学科领域建设的必要性,认为应以装备物流作为物流工程的核心,以求找准定位、突出特色,同时展望了我院以装备物流为核心的物流工程学科领域发展的前景.     

Determining crane areas for balancing workload among interfering and noninterfering cranes

This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un‐)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross‐over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

装备主动式保障系统需求建模及应用

针对装备主动式保障系统建设中存在的需求把握不准、难以全面的问题,引入对象建模技术,建立装备主动式保障系统的对象模型、动态模型和功能模型,从保障系统组元间相互关系、组元间动态时序关系及功能实现3个角度描述了保障系统需求情况。基于需求建模结果,给出了装备主动式保障系统各功能子系统的信息流程,为后续装备主动式保障系统实现奠定了基础。     

装备器材多级库存决策优化模型研究

研究了装备器材管理的成本构成特点,认为装备器材多极库存系统可简化为n级系列体系结构。建立了装备器材多级库存优化控制模型,通过模型求解和相应实例分析,表明了装备器材多级库存优化控制方法的可行性和有效性。     

应急物流保障与军地物流一体化研究

应急物流与军事物流都是在特殊条件下发生的物流活动,研究应急物流与军地物流一体化对于促进军事物流的发展具有重要意义.简述了应急物流的基本问题,分析了实现应急物流保障的基本条件:需要完善的应急法律体系、功能健全的应急指挥机构以及高效可靠的应急物流保障平台,阐明了军地物流一体化与应急物流的区别、军地物流一体化的重要作用,并对军地物流一体化下的应急物流保障模式进行了研究.     

Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005