Analysis of a new vehicle scheduling and location problem

We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

无摩擦的空气轴承技术对超精密加工机床进给驱动系统的控制需…

加工过程中随着对精密度和加工环境的要求的不断提高,越来越需要在机床的结构和控制器原理这两者之间进行特殊的组合。近年来,为了补偿进给驱动系统的直接导轨的摩擦造成的影响,人们发明了大量的控制决策,例如［１］－［３］。他们虽然提供了各式各样的功能强大的非线性的机构,但通常又使用相当复杂的计算机算法来耗费系统资源。借助于先进的空气静压轴承技术（ＦＶＭ－空气－轴承）摩擦可以被彻底消除,因而直线导轨也就不存在     

基于神经网络的超精密机床伺服进给非线性模型辨识

以双轴Ｔ型结构的超精密金刚石车床的伺服进给系统为研究对象,采用自构造神经网络技术,建立了系统的非线性动态数学模型,为系统非线性控制与补偿提供参考模型     

The stochastic duel with time-dependent hit probabilities

The fundamental stochastic duel considers two opponents who fire at each other at either random continuous or fixed-time intervals with a constant hit probability on each round fired. Each starts with an unloaded weapon, unlimited ammunition, and unlimited time. The first to hit wins. In this article we extend the theory to the case where hit probabilities are functions of the time since the duel began. First, the marksman firing at a passive target is considered and the characteristic function of the time to a hit is developed. Then, the probability of a given side winning the duel is derived. General solutions for a wide class of hit probability functions are derived. Specific examples of both the marksman and the duel problem are given.     

Optimal control of entry to an M/Ek/1 queue serving several classes of customers

The individual and social optimum control policies for entry to an M/M//1 queue serving several classes of customers have been shown to be control-limit policies. The technique of policy iteration provides the social optimum policy for such a queue in a straightforward manner. In this article, the problem of finding the optimal control policy for the M/E_k/1 system is solved, thereby expanding the potential applicability of the solutions developed. The Markovian nature of the queueing system is preserved by considering the service as having k sequential phases, each with independent, identically distributed, exponential service times, through which a customer must pass to be serviced. The optimal policy derived by policy iteration for such a system is likely to be difficult to use because it requires knowledge of the number of phases rather than customers in the system when an arrival occurs. To circumvent this difficulty, a heuristic is used to find a good usable (implementable) solution. In addition, a mixed-integer program is developed which yields the optimal implementable solution when solved.     

A performance comparison of empirical Bayes and Bayes estimators of the Weibull and gamma scale parameters

A mean-squared error comparison of smooth empirical Bayes and Bayes estimators for the Weibull and gamma scale parameters is studied based on a computer simulation. The smooth empirical Bayes estimators are determined as functions of up to 15 past estimates of the parameter of interest. Results indicate that at best the mean-squared errors of the empirical Bayes estimators are about 20–40% larger than those of the corresponding squared-error optimal Bayes estimators.