-
作者：ZHENG, YS; FEDERGRUEN, A
作者单位：Columbia University
摘要：In this paper, a new algorithm for computing optimal (s, S) policies is derived based upon a number of new properties of the infinite horizon cost function c(s, S) as well as a new upper bound for optimal order-up-to levels S* and a new lower bound for optimal reorder levels S*. The algorithm is simple and easy to understand. Its computational complexity is only 2.4 times that required to evaluate a (specific) single (s, S) policy. The algorithm applies to both periodic review and continuous r...
-
作者：KOUVELIS, P; LEE, HL
作者单位：Stanford University
摘要：Loading problems of Flexible Manufacturing Systems (FMSs) have usually been formulated as an integer program with nonlinear constraints for tool magazine capacities. The nonlinearity and integer nature of the problem results in the loading problem being difficult to solve. Conventional branch-and-bound methods have been proposed, but again the solution time can easily be excessive for moderate sized problems. In this paper, we present an alternative formulation of the FMS loading problem. Such...
-
作者：THOMAS, LD
摘要：The application of commonality in a system represents an attempt to reduce costs by reducing the number of unique components. A formal method for conducting commonality analysis has not been established. This paper characterizes commonality analysis as a partitioning problem for which the solution may be approximated by the application of clustering methods. A clustering algorithm is developed and applied to a commonality analysis of Space Station water tanks. The success in applying a cluster...
-
作者：COLIN, JY; CHRETIENNE, P
作者单位：Sorbonne Universite; IMT - Institut Mines-Telecom; Institut Polytechnique de Paris; Telecom SudParis
摘要：This paper addresses a machine scheduling problem that arises in the case of scheduling tasks over an idealized distributed multiprocessor. Precedence constraints with small communication delays have to be taken into account and task duplication is allowed. A critical path-like algorithm is presented, which is shown to construct an optimal schedule in polynomial time.
-
作者：HODGES, JS
摘要：Many models used in policy or systems analysis either cannot be validated in any fully adequate sense, such as by comparing them with actual data, or could adequately be validated but have not been. For example, in the area of combat analysis, the central models are arguably almost entirely unvalidated and most will never be susceptible to adequate validation. Nevertheless, such models are often used and can be used fruitfully, even though we have no theory for how to use them or how to interp...
-
作者：BURD, SD; KASSICIEH, SK
摘要：This paper reports on a decision support system (DSS) for computer capacity planning. The system was developed for Sandia National Laboratories (SNL) to support planning in an environment characterized by large-scale scientific computing needs, governmental budgetary limitations and specific planning documentation required by the funding source. The implementation of the system is based directly on the concepts of relational model management and logic-based model representation and manipulatio...
-
作者：JOHNSON, DS; ARAGON, CR; MCGEOCH, LA; SCHEVON, C
作者单位：University of California System; University of California Berkeley; Amherst College; Johns Hopkins University
摘要：This is the second in a series of three papers that empirically examine the competitiveness of simulated annealing in certain well-studied domains of combinatorial optimization. Simulated annealing is a randomized technique proposed by S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi for improving local optimization algorithms. Here we report on experiments at adapting simulated annealing to graph coloring and number partitioning, two problems for which local optimization had not previously been ...
-
作者：PRASAD, VR; NAIR, KPK; ANEJA, YP
作者单位：University of Windsor
摘要：This paper deals with the problem of assigning components to parallel-series (PS) and series-parallel (SP) systems so as to maximize the system's reliability. We assume that any component can be assigned to any position of the system and the reliability of component j is r(i)p(j) if it is assigned to position i. Exploiting the nature of Schur-convex functions, an algorithm is developed to obtain an optimal assignment for PS systems. Also, a simple optimal assignment rule is derived for SP syst...
-
作者：THOMAS, LC; WASHBURN, AR
作者单位：United States Department of Defense; United States Navy; Naval Postgraduate School
摘要：In these games the searcher has a sequence of looks in which to detect the target, while the target chooses a new cell after each look in the knowledge of what cells have been searched so far. Since time is of the essence and the searcher's speed is bounded, the target has a tendency to choose cells far away from the most recent look. A theory for such games is developed and used to approximate a game involving a dipping sonar.
-
作者：SHULMAN, A
摘要：In the Dynamic Capacitated Plant Location Problem (DCPLP) the task is to find a time schedule and sizes for installing facilities at plant locations to minimize the discounted cost of capital expenditures over the planning horizon. The costs include setup cost for establishing facilities, volume dependent operational costs, and transportation costs for distributing demand from facilities to customers. We consider a class of the DCPLP in which the available facilities have finite capacities and...
