首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   291篇
  免费   4篇
  2021年   4篇
  2019年   3篇
  2017年   4篇
  2016年   4篇
  2015年   5篇
  2014年   3篇
  2013年   69篇
  2011年   2篇
  2010年   2篇
  2009年   2篇
  2008年   3篇
  2007年   3篇
  2006年   3篇
  2005年   4篇
  2004年   2篇
  2003年   4篇
  2002年   2篇
  2001年   2篇
  2000年   3篇
  1999年   4篇
  1996年   5篇
  1995年   6篇
  1994年   7篇
  1993年   5篇
  1992年   3篇
  1991年   7篇
  1990年   3篇
  1989年   9篇
  1988年   7篇
  1987年   5篇
  1986年   8篇
  1985年   5篇
  1983年   4篇
  1982年   9篇
  1980年   5篇
  1979年   3篇
  1978年   4篇
  1977年   4篇
  1976年   4篇
  1975年   6篇
  1974年   6篇
  1973年   8篇
  1972年   7篇
  1971年   8篇
  1970年   5篇
  1969年   5篇
  1968年   5篇
  1967年   2篇
  1966年   2篇
  1948年   3篇
排序方式: 共有295条查询结果,搜索用时 46 毫秒
11.
This paper is concerned with the optimum decision variables found using order quantity, reorder point (Q, R) inventory models. It examines whether the optimum variables (Q* and R*) are necessarily monotonic functions of the backorder cost parameter (or equivalently of the performance objective). For a general class of models it is proved that R* must increase as the performance objective is raised, and an inequality condition is derived which governs how Q* will change. Probability distributions of lead time demand are cited or found for which Q* increases, Q* decreases, and Q* is independent of increases in performance objectives or backorder cost parameter.  相似文献   
12.
Under certain conditions, the re-supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction.  相似文献   
13.
This paper presents a general solution for the M/M/r queue with instantaneous jockeying and r > 1 servers. The solution is obtained in matrices in closed form without recourse to the generating function arguments usually used. The solution requires the inversion of two (Zr?1) × (2r?1) matrices. The method proposed is extended to allow different queue selection preferences of arriving customers, balking of arrivals, jockeying preference rules, and queue dependent selection along with jockeying. To illustrate the results, a problem previously published is studied to show how known results are obtained from the proposed general solution.  相似文献   
14.
Book reviews     
Exporting Democracy: Fulfilling America's Destiny. By Joshua Muravchik, American Enterprise Institute (1991) ISSN 0–8447–3734–8. $12.95.

Generals in the Palacio. By Roderick Ai Camp. Oxford University Press, (1992), ISBN 0–19–507300–2, £45.

L'Armement en France. Genèse, Ampleur et Coût d'une Industrie By François Chesnais and Claude Serfati, Editions Nathan, Collection Economie/Sciences Sociales, Paris (1992), ISBN 2–09–190086–9.

The Têt Offensive. Intelligence Failure in War. By James Wirtz, Cornell University Press, New York (1991), ISBN 0–8014–2486–0. $38.50.

Restructuring of arms producton in Western Europe. Edited by Michael Brzoska and Peter Lock. Oxford University Press, Oxford (1992), ISBN 0–1982–9147–7. £25.00.

What is Proper Soldiering? A study of new perspectives for the future uses of the Armed Forces of the 1990s. By Michael Harbottle. The Centre for International Peacebuilding, Chipping Norton (1992), £3.50.

The Strategic Defence Initiative By Edward Reiss, Cambridge University Press, Cambridge (1992), ISBN 0–521–41097–5. £30.00.  相似文献   

15.
16.
17.
Makers of Modern Strategy: Military Thought from Machiavelli to Hitler. Edited by Edward Mead Earle. Princeton University Press, Princeton, NJ (1943)  相似文献   
18.
19.
About thirty references that feature naval logistics environments are considered. All are unclassified and all appear in the open literature or are available from the Defense Logistics Studies Information Exchange. Three approaches are identified–data analysis, theoretical models, and readiness indexes–and conclusions are presented as to possibilities for answering two questions: (a) Can the unit do the job? (b) How does readiness depend on resources? Four cases are treated in detail to illustrate methodology.  相似文献   
20.
The problem of multiple-resource capacity planning under an infinite time horizon is analyzed using a nonlinear programming model. The analysis generalizes to the long term the short-run pricing model for computer networks developed in Kriebel and Mikhail [5]. The environment assumes heterogeneous resource capacities by age (vingate), which service a heterogeneous and relatively captive market of users with known demand functions in each time period. Total variable operating costs are given by a continuous psuedoconcave function of system load, capacity, and resource age. Optimal investment, pricing, and replacement decision rules are derived in the presence of economies of scale and exogenous technological progress. Myopic properties of the decision rules which define natural (finite) planning subhorizons are discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号