-
作者：SCHOUTEN, FAV; VANNESTE, SG
摘要：Optimal group maintenance policies for a set of M identical machines subject to stochastic failures are considered. The control of the system is not based on the complete age configuration of all components, nor on the number of failed components only. We compromise between these two extreme cases by introducing four possible states for each component: good, doubtful, preventive maintenance is due, and failed. Two types of control policies are considered, both based on the number of doubtful c...
-
作者：XU, SH; SHANTHIKUMAR, JG
作者单位：University of California System; University of California Berkeley
摘要：In this paper we obtain the optimal admission control policy for a first-come, first-served (FCFS) M/M/m ordered-entry queueing system to maximize the expected discounted (and the long-run average) profit (reward minus cost). We introduce a new approach for determining the optimal admission control policy. The underlying idea of this approach is to construct a dual system: a preemptive last-come, first-served (LCFS-P) M/M/m ordered-entry queueing system that is subject to expulsion control. We...
-
作者：BRIMBERG, J; LOVE, RF
作者单位：McMaster University
摘要：This paper considers a general form of the single facility minisum location problem (also referred to as the Fermat-Weber problem), where distances are measured by an I,norm. An iterative solution algorithm is given which generalizes the well-known Weiszfeld procedure for Euclidean distances. Global convergence of the algorithm is proven for any value of the parameter p in the closed interval [1, 2], provided an iterate does not coincide with a singular point of the iteration functions. Howeve...
-
作者：ROSEN, JB; XUE, GL
作者单位：University of Vermont
摘要：For the Euclidean single facility location problem, E. Weiszfeld proposed a simple closed-form iterative algorithm in 1937. Later, numerous authors proved that it is a convergent descent algorithm. In 1973, J. Eyster, J. White and W. Wierwille extended Weiszfeld's idea and proposed a Hyperboloid Approximation Procedure (HAP) for solving the Euclidean multifacility location problem. They believed, based on considerable computational experience, that the HAP always converges. In 1977, Ostresh pr...
-
作者：DIABY, M
摘要：We present an implicit enumeration procedure for solving pure integer 0/1 minimax problems which arise in the context of Benders decomposition for mixed integer 0/1 linear programming problems, or in various practical settings such as the location of facilities and assembly line balancing. The procedure is an extension of the additive algorithm of E. Balas for pure integer 0/1 programming problems. We solve minimax problems directly (i.e., as minimax problems, not as mixed integer programming ...
