On competitive analysis for polling systems

Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems.     

未成年人监护制度的设置与立法选择

目前,我国监护法律制度还很不完善,对未成年人监护只规定了法定监护和指定监护制度,没有规定遗嘱监护和委托监护制度;现行法律规定作为指定监护的指定机关在运作实践中遇到许多问题;立法上有关监护产生的原因和监护的变更、终止事由与程序规定均不明确。这些均需要在制定我国《民法典》时进一步加以充实与完善,以充分发挥未成年人监护制度应有的作用。     

Change as a cost driver in defence procurement

This paper discusses change transactions that occur in connection with the procurement of defence systems. The bases for the reasoning are the ideas of Miller and Vollman (1985 Miller JG Vollman TE (1985) The hidden factory – cutting the explosive growth of overhead costs requires mastery of more than just what happens on the shop floor Harvard Business Review Sept–Oct 142 150  [Google Scholar]) and Eppinger (2001 Eppinger DE (2001) Innovation at the speed of information Harvard Business Review January 149 158  [Google Scholar]). These researchers argue that unplanned flows of information lead to change transactions, causing significant overhead costs. According to this paper, change transactions in defence procurement could be caused by (a) the changes in technology taking place during the long lifetime of a defence system and (b) the structure and contents of the agreements between the defence agent (the procurer) and the defence industry (the supplier).     

The single and multi‐item transshipment problem with fixed transshipment costs

This article deals with supply chain systems in which lateral transshipments are allowed. For a system with two retailers facing stochastic demand, we relax the assumption of negligible fixed transshipment costs, thus, extending existing results for the single‐item case and introducing a new model with multiple items. The goal is to determine optimal transshipment and replenishment policies, such that the total centralized expected profit of both retailers is maximized. For the single‐item problem with fixed transshipment costs, we develop optimality conditions, analyze the expected profit function, and identify the optimal solution. We extend our analysis to multiple items with joint fixed transshipment costs, a problem that has not been investigated previously in the literature, and show how the optimality conditions may be extended for any number of items. Due to the complexity involved in solving these conditions, we suggest a simple heuristic based on the single‐item results. Finally, we conduct a numerical study that provides managerial insights on the solutions obtained in various settings and demonstrates that the suggested heuristic performs very well. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 637–664, 2014     

Maintenance scheduling for modular systems: Modeling and algorithms

We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014     

高速精密主轴径向误差的测试

对高速精密主轴的径向误差进行测试 ,主轴的高速可能会使误差分离的方法不再成立 ,通过模态分析 ,验证了该系统的误差分离的可能性。在测试中常用精密主轴来直接代替精密钢球进行测试 ,这样会带来测量误差 ,本文对这个问题进行了分析。另外还对传感器探头安装误差进行了分析。     

Economic lot sizing with constant capacities and concave inventory costs

This article studies the classical single‐item economic lot‐sizing problem with constant capacities, fixed‐plus‐linear order costs, and concave inventory costs, where backlogging is allowed. We propose an O(T³) optimal algorithm for the problem, which improves upon the O(T⁴) running time of the famous algorithm developed by Florian and Klein (Manage Sci18 (1971) 12–20). Instead of using the standard dynamic programming approach by predetermining the minimal cost for every possible subplan, we develop a backward dynamic programming algorithm to obtain a more efficient implementation. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012