排序方式: 共有223条查询结果,搜索用时 0 毫秒
201.
202.
Thomas R. Mockaitis Max G. Manwaring Daniel W. Fitz‐Simons Richard Holmes 《Small Wars & Insurgencies》2013,24(2):254-260
Norman Cigar, Genocide in Bosnia: The Policy of “Ethnic Cleansing”. College Station, Texas: Texas A&M University Press, 1995. Pp.xiv + 247; app., map, notes, cartoon. Maria Jose Moyano, Argentina's Lost Patrol: Armed Struggle, 1969–1979. New Haven: Connecticut Yale University Press, 1995. Pp.xiii + 226, biblio., abbreviations, 10 figures, 1 map, tables, index; $25/£16.95. ISBN 0–300–01622–6. Donald E. Schulz and Deborah Sundloff Schulz, The United States, Honduras, and the Crisis in Central America, Westview Thematic Studies in Latin America, Boulder, Co: Westview, 1994. Pp.368, map, figure, select biblio., abbreviations, index. $52.50/£37.50; (cloth) $17.95/£11.95 (paper). ISBN 0–8133–1324–4 and 1323–6. Joseph H. Alexander and Merrill L. Bartlett, Sea Soldiers in the Cold War: Amphibious Warfare 1945–1991. Annapolis, Maryland: Naval Institute Press, 1995. Pp.iii + 178, 1 map, 29 illus, biblio, index. $32.95. ISBN Gary P. Cox, The Halt in the Mud: French Strategic Planning from Waterloo to Sedan. Westview Press, 1994. Pp.258, maps, notes, biblio, index. £33.50. ISBN 0–133–1536–0. 相似文献
203.
In a typical assemble‐to‐order system, a customer order may request multiple items, and the order may not be filled if any of the requested items are out of stock. A key customer service measure when unfilled orders are backordered is the order‐based backorder level. To evaluate this crucial performance measure, a fundamental question is whether the stationary joint inventory positions follow an independent and uniform distribution. In this context, this is equivalent to the irreducibility of the Markov chain formed by the joint inventory positions. This article presents a necessary and sufficient condition for the irreducibility of such a Markov chain through a set of simultaneous Diophantine equations. This result also leads to sufficient conditions that are more general than those in the published reports. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
204.
The scan statistic based on likelihood ratios (LRs) have been widely discussed for detecting spatial clusters. When developing the scan statistic, it uses the maximum likelihood estimates of the incidence rates inside and outside candidate clusters to substitute the true values in the LR statistic. However, the parameter estimation has a significant impact on the sensitivity of the scan statistic, which favors the detection of clusters in areas with large population sizes. By presenting the effects of parameter estimation on Kulldorff's scan statistic, we suggest a standardized scan statistic for spatial cluster detection. Compared to the traditional scan statistic, the standardized scan statistic can account for the varying mean and variance of the LR statistic due to inhomogeneous background population sizes. Extensive simulations have been performed to compare the power of the two cluster detection methods with known or/and estimated parameters. The simulation results show that the standardization can help alleviate the effects of parameter estimation and improve the detection of localized clusters. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
205.
The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
206.
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work 下载免费PDF全文
We consider the problem of scheduling n independent and simultaneously available jobs without preemption on a single machine, where the machine has a fixed maintenance activity. The objective is to find the optimal job sequence to minimize the total amount of late work, where the late work of a job is the amount of processing of the job that is performed after its due date. We first discuss the approximability of the problem. We then develop two pseudo‐polynomial dynamic programming algorithms and a fully polynomial‐time approximation scheme for the problem. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 172–183, 2016 相似文献
207.
Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support 下载免费PDF全文
Kathryn M. Schumacher Richard Li‐Yang Chen Amy E.M. Cohn Jeremy Castaing 《海军后勤学研究》2016,63(3):236-246
We consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real‐world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum‐cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance‐constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user‐defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut‐sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 236–246, 2016 相似文献
208.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016 相似文献
209.
We consider three network disconnection problems in a centralized network where a source node provides service to the other nodes, called demand nodes. In network disconnection problems, each demand node gets a certain benefit when connected to a source node and a network attacker destroys edges to prevent demand nodes from achieving benefits. As destroying edges incurs expenses, an attacker considers the following three different strategies. The first is to maximize the sum of benefits of the disconnected nodes while keeping the total edge destruction cost no more than a given budget. The second is to minimize the total destruction cost needed to make a certain amount of benefits not accomplished. The last is to minimize the ratio of the total destruction cost to the benefits not accomplished. In this paper, we develop exact algorithms to solve the above three problems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
210.
Various indices of component importance with respect to system reliability have been proposed. The most popular one is the Birnbaum importance. In particular, a special case called uniform Birnbaum importance in which all components have the same reliability p has been widely studied for the consecutive‐k system. Since it is not easy to compare uniform Birnbaum importance, the literature has looked into the case p = ½, p → 1, or p ≥ ½. In this paper, we look into the case p → 0 to complete the spectrum of examining Birnbaum importance over the whole range of p. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 159–166, 2002; DOI 10.1002/nav.10001 相似文献