全文获取类型
收费全文 | 127篇 |
免费 | 3篇 |
出版年
2021年 | 1篇 |
2020年 | 1篇 |
2019年 | 5篇 |
2018年 | 2篇 |
2017年 | 6篇 |
2016年 | 1篇 |
2015年 | 2篇 |
2014年 | 7篇 |
2013年 | 50篇 |
2012年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2007年 | 1篇 |
2005年 | 2篇 |
2002年 | 1篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 5篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1982年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1968年 | 1篇 |
1967年 | 3篇 |
排序方式: 共有130条查询结果,搜索用时 15 毫秒
91.
Capability-based planning (CBP) is considered by many defence organisations to be the best practice for enterprise-level planning, analysis and management. This approach, loosely based around investment portfolio theory, is premised on balancing the cost, benefit and risk of capability options across the defence enterprise. However a number of authors have recently noted limitations of its current applications. The authors propose a more general, insurance-based approach, which can support the evolutionary improvement of the current CBP approach. This approach is implemented as hedging-based planning and aims to better reflect the enterprise nature of defence organisations, capturing both force structure and force generation aspects of military systems. 相似文献
92.
Cyberspace has emerged as a potentially new (and unconventional) domain for warfare. Much debate has focused on understanding cyber conflict. The ability to critically analyse this phenomenon is important; however, the nascent nature of cyberwarfare and the complexity of the systems involved create challenges not met by conventional approaches. As a first step, this requires an analytical construct to frame discussions in a way that highlights distinct characteristics of the cyber domain. An approach proposed is one of the postulating conjectures for debate as a way to achieve this and to demonstrate its use, both at the strategic and operational levels. It is suggested that such an approach provides one component of a mature analytical framework for the analysis of cyber across a range of warfare domains. 相似文献
93.
In this paper, we explore trade‐offs between operational flexibility and operational complexity in periodic distribution problems. We consider the gains from operational flexibility in terms of vehicle routing costs and customer service benefits, as well as the costs of operational complexity in terms of modeling, solution methods, and implementation challenges for drivers and customers. The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time; the PVRP with service choice (PVRP‐SC) extends the PVRP to allow service (visit) frequency to become a decision of the model. For the periodic distribution problems represented by PVRP and PVRP‐SC, we introduce operational flexibility levers and a set of quantitative measures to evaluate the trade‐offs between flexibility and complexity. We develop a Tabu Search heuristic to incorporate a range of operational flexibility options. We analyze the potential value and the increased operational complexity of the flexibility levers. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
94.
Nicholas G. Hall Gilbert Laporte Esaignani Selvarajah Chelliah Sriskandarajah 《海军后勤学研究》2005,52(3):261-275
We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
95.
Nicholas G. Hall 《海军后勤学研究》1986,33(1):49-54
This article concerns the scheduling of n jobs around a common due date, so as to minimize the average total earliness plus total lateness of the jobs. Optimality conditions for the problem are developed, based on its equivalence to an easy scheduling problem. It seems that this problem inherently has a huge number of optimal solutions and an algorithm is developed to find many of them. The model is extended to allow for the availability of multiple parallel processors and an efficient algorithm is developed for that problem. In this more general case also, the algorithm permits great flexibility in finding an optimal schedule. 相似文献
96.
Peter Kubat 《海军后勤学研究》1982,29(3):399-402
Let Xi be independent IFR random variables and let Yi be independent exponential random variables such that E[Xi]=E[Yi] for all i=1, 2, ? n. Then it is well known that E[min (Xi)] ≥E[min (Xi)]. Nevertheless, for 1≤i≤n exponentially distributed Xi's and for a decreasing convex function ?(.). it is shown that . 相似文献
97.
98.
An algorithm, based upon dynamic programming, is developed for a class of fixed-cost cargo loading problems. The problems can be formulated as integer programming problems, but cannot be efficiently solved as such because of computational difficulties. The algorithm developed has proved to be very efficient in an actual operations research study involving over 500 different cargo items, more than 40 possible stops and several types of transportation vehicles. A numerical illustration is provided. 相似文献
99.
100.
NATO burden sharing has become an especially timely issue in the past several years as a result of a number of factors, including Russian annexation of Crimea and destabilization of eastern Ukraine in 2014. This article argues that alliance unity among the great democracies of Europe and North America is indispensable to peace and stability on the Eurasian continent. A fractured NATO, and especially, a large divide in purposes or commitments as between the United States and its European security partners, invites aggression and the possibility of inadvertent escalation. Past successes and failures in US-involved multinational peace and stability operations, within and outside of Europe, show that mission accomplishment requires give and take, including the occasional acceptance of unequal costs and benefits among the members, in order to achieve peace and security objectives. 相似文献