全文获取类型
收费全文 | 269篇 |
免费 | 11篇 |
出版年
2021年 | 1篇 |
2020年 | 1篇 |
2019年 | 5篇 |
2018年 | 5篇 |
2017年 | 8篇 |
2016年 | 8篇 |
2015年 | 6篇 |
2014年 | 7篇 |
2013年 | 83篇 |
2012年 | 2篇 |
2011年 | 6篇 |
2010年 | 4篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 7篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 2篇 |
2002年 | 5篇 |
2001年 | 1篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1996年 | 6篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 7篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 9篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1983年 | 4篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1977年 | 3篇 |
1975年 | 4篇 |
1973年 | 3篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1968年 | 1篇 |
1967年 | 3篇 |
1966年 | 1篇 |
排序方式: 共有280条查询结果,搜索用时 15 毫秒
231.
232.
In this paper we investigate the collection depots location problem on a network. A facility needs to be located to serve a set of customers. Each service consists of a trip to the customer, collecting materials, dropping the materials at one of the available collection depots and returning to the facility to wait for the next call. Two objectives are considered: minimizing the weighted sum of distances and minimizing the maximum distance. The properties of the solutions to these problems are described. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 15–24, 2002; DOI 10.1002/nav.10000 相似文献
233.
George Tagaras 《海军后勤学研究》1989,36(5):639-654
A new approximate method is proposed for the economic design of control charts based on an estimate of the power of the control chart at optimality. Multiple linear regression is employed for the derivation of the approximate formula expressing the power of the control chart as a function of the model parameters. A simple optimization procedure is then used to determine the economic design of the control chart for the predicted value of the chart's detection power. The application of the new approach is illustrated through Duncan's models for variables control charts for processes subject to single and multiple assignable causes. Evaluation of the performance of the approximate method indicates that the approximate control chart design is very close to the exact optimum while its implementation requirements are reduced. 相似文献
234.
Monte Carlo estimation of the maximal flow distribution with discrete stochastic arc capacity levels
George S. Fishman 《海军后勤学研究》1989,36(6):829-849
This article describes a highly efficient Monte Carolo sampling plan for estimating ordinates of the complementary distribution function of the maximal s-t flow in a directed network with source node s, terminal node t and whose arcs assume random capacities. Communication, electric power, transportation, and water distribution systems fit this representation. The article derives point estimates and interval estimates that hold for finite sample sizes, and shows the extent to which the proposed technique saves time, as compared to crude Monte Carlo sampling, in achieving a specified accuracy. 相似文献
235.
J. George Shanthikumar 《海军后勤学研究》1989,36(6):797-806
The two purposes of this article are to illustrate the power and simplicity of level crossing analysis and to present a conservation identity for M/G/1 priority queues with server vacations. To illustrate the use of level crossing analysis we apply it to preemptive (resume) priority M/G/1 queues with single- and multiple-server vacations considered by Kella and Yechiali (1986) and to non-preemptive priority M/M/c queues considered by Kella and Yechiali (1985). The conservation identity presented here states that the ratios of mean waiting times in an M/G/1 queue with and without server vacation policies are independent of the service discipline for first come first served, shortest processing time, shortest processing time within generations and non-preemptive priority service disciplines. 相似文献
236.
Michael Evans 《Defense & Security Analysis》2019,35(2):133-146
The most effective way for the Western profession of arms to use history is to disavow the purism and narrow specialisation of today’s academia in favour of developing a contemporary approach to the subject. The latter aims to foster a range of applied diagnostic skills that transcend the temporal dimensions of past, present, and future. A contemporary approach to history for military professionals emphasises the use of inter-disciplinary war studies to enhance policy relevance. In any defense and security organisation, history must be usable in the sense of providing cognitive and interpretative skills for probing relationships between possibility and actuality, between experience and expectation, and between singularity and repetition. Using history to examine such dialectical interconnections is particularly valuable when military establishments confront their essential task of analyzing emerging trends in the future of war. 相似文献
237.
Once dismissed by many outside observers, the Chinese People’s Liberation Army Air Force (PLAAF) has undergone an impressive transformation over the past two decades, emerging as one of the world’s premier air forces. As it continues to modernize, it is focused on becoming a ‘strategic air force.’ PLAAF strategists suggest this means it should play a decisive role in protecting Chinese national interests, field modern capabilities commensurate with China’s standing as a major power, and enjoy the institutional status befitting its role as a ‘strategic service,’ an important consideration given the historical dominance of the ground force in China’s military. 相似文献
238.
In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016 相似文献
239.
Michael E. Smith 《Contemporary Security Policy》2016,37(3):446-460
The EU Global Strategy (EUGS) is a broad and ambitious document in terms of its geographic scope and thematic priorities. However, the EU cannot devote equal attention to all aspects of the EUGS; so there is still scope for more clarity regarding the EU’s core strategic aims. This article argues that in addition to fostering internal cohesion, the EU’s strategic priority must involve stabilizing its own neighbourhood. This task has challenged the EU for decades because of an inherent credibility deficit regarding the EU’s own capabilities, yet the EUGS does not diagnose and remedy this problem as effectively as it could have. Therefore much more work will need to be done in terms of reforming EU institutions and developing common capabilities if the EU hopes to achieve its central internal and external security goals as outlined in the EUGS and related policy statements. 相似文献
240.
We present a branch‐and‐price technique for optimal staff scheduling with multiple rest breaks, meal break, and break windows. We devise and implement specialized branching rules suitable for solving the set covering type formulation implicitly, using column generation. Our methodology is more widely applicable and computationally superior to the alternative methods in the literature. We tested our methodology on 365 test problems involving between 1728 and 86400 shift variations, and 20 demand patterns. In a direct comparison with an alternative method, our approach yields significant improvements both in cpu time and in the number of problem instances solved to optimality. The improvements were particularly marked for problems involving larger numbers of feasible shifts. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 185–200, 2000 相似文献