Transporting jobs through a two‐machine open shop

We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

消防监督监察工作中存在的问题与对策

消防监督监察作为消防工作的重要环节,是预防控制火灾的关键,然而,新形势下的消防监督监察工作面临着许多新挑战、新问题。针对当前存在的情况,制定了一系列的对策,从而更好地完善消防监督监察工作体系,最大限度地减少火灾发生的概率。     

新时期立体化农村消防工作格局构建

阐述了新时期农村消防工作存在的现实问题及解决对策,提出了构建立体化农村消防防工作格局和“区域联防”消防网络的构想。     

当前消防监督执法存在问题与对策探讨

指出了当前消防监督执法中存在的问题,对问题产生的根源进行了剖析,提出了加强和改进消防监督执法工作的对策。     

火场战斗力量转移的优化设计

在一些特殊火灾扑救中,如何在总战斗力量一定的情况下从中抽调部分力量去处置新的灾害事故,这就涉及到一个战斗力量转移的优化配置问题。探讨建立了消防力量优化配置的模型,同时试运用运输模型来求解得出优化配置方案。     

论教学过程中的理性思维

教学过程本来是个理性的实践过程,但是,目前现实的情况确实存在一些非理性的现象和问题,影响教学过程的质量。本文从现实教学过程存在的非理性问题和现象,产生和形成的原因,以及如何进行理性思考和反思等方面进行分析,以提高教学的实效性、创新性。     

Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems

This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008