全文获取类型
收费全文 | 384篇 |
免费 | 14篇 |
出版年
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 15篇 |
2018年 | 10篇 |
2017年 | 6篇 |
2016年 | 11篇 |
2015年 | 8篇 |
2014年 | 7篇 |
2013年 | 106篇 |
2011年 | 8篇 |
2009年 | 5篇 |
2008年 | 5篇 |
2007年 | 10篇 |
2006年 | 3篇 |
2005年 | 6篇 |
2004年 | 3篇 |
2003年 | 4篇 |
2002年 | 7篇 |
2001年 | 3篇 |
1999年 | 7篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 9篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 5篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1978年 | 7篇 |
1975年 | 4篇 |
1974年 | 3篇 |
1973年 | 8篇 |
1972年 | 5篇 |
1971年 | 8篇 |
1970年 | 4篇 |
1968年 | 3篇 |
1967年 | 5篇 |
1966年 | 6篇 |
排序方式: 共有398条查询结果,搜索用时 15 毫秒
271.
David A. Butler 《海军后勤学研究》1979,26(4):565-578
Means of measuring and ranking a system's components relative to their importance to the system reliability have been developed by a number of authors. This paper investigates a new ranking that is based upon minimal cuts and compares it with existing definitions. The new ranking is shown to be easily calculated from readily obtainable information and to be most useful for systems composed of highly reliable components. The paper also discusses extensions of importance measures and rankings to systems in which both the system and its components may be in any of a finite number of states. Many of the results about importance measures and rankings for binary systems are shown to extend to the more sophisticated multi-state systems. Also, the multi-state importance measures and rankings are shown to be decomposable into a number of sub-measures and rankings. 相似文献
272.
273.
274.
A general multiperiod multi-echelon supply system consisting of n facilities each stocking a single product is studied. At the beginning of a period each facility may order stock from an exogenous source with no delivery lag and proportional ordering costs. During the period the (random) demands at the facilities are satisfied according to a given supply policy that determines to what extent stock may be redistributed from facilities with excess stock to those experiencing shortages. There are storage, shortage, and transportation costs. An ordering policy that minimizes expected costs is sought. If the initial stock is sufficiently small and certain other conditions are fulfilled, it is optimal to order up to a certain base stock level at each facility. The special supply policy in which each facility except facility 1 passes its shortages on to a given lower numbered facility called its direct supplier is examined in some detail. Bounds on the base stock levels are obtained. It is also shown that if the demand distribution at facility j is stochastically smaller (“spread” less) than that at another facility k having the same direct supplier and if certain other conditions are fulfilled, then the optimal base stock level (“virtual” stock out probability) at j is less than (greater than) or equal to that at facility k. 相似文献
275.
David P. Herron 《海军后勤学研究》1966,13(2):167-176
The iteration usually necessary for simultaneous determination of minimum-cost order quantity and reorder point in (Q, r) inventory systems may be eliminated by a graphical technique employing dimensionless ratios. This technique is illustrated for three different types of stock-out penalty. 相似文献
276.
F. M. Scherer 《海军后勤学研究》1966,13(1):71-82
This paper explores the relationship between research project cost and expected time to completion under various scheduling strategies; it assumes that many potential technical approaches to the research problem can be identified; and that each approach has a low but finite subjective probability of success. It is shown that under a variety of assumptions, expected time to project completion can be reduced, but that as a result expected project cost rises at an increasing rate. Some cases in which this convex time-cost tradeoff relationship might not hold generally are identified. When the time-cost tradeoff function is convex, the desirability of concurrent as opposed to series scheduling of approaches depends crucially upon the depth of the stream of benefits expected to be realized upon successful project completion. The deeper the benefit stream is, the more desirable concurrent scheduling is. 相似文献
277.
David R. Morrison Jason J. Sauppe Wenda Zhang Sheldon H. Jacobson Edward C. Sewell 《海军后勤学研究》2017,64(1):64-82
The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017 相似文献
278.
Robert F. Dell James N. Eagle Gustavo Henrique Alves Martins Almir Garnier Santos 《海军后勤学研究》1996,43(4):463-480
The search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing approaches when used with only a single searcher. For more than one searcher, the time needed to guarantee an optimal solution is prohibitive. Our heuristics represent a wide variety of approaches: One solves partial problems optimally, two use paths based on maximizing the expected number of detections, two are genetic algorithm implementations, and one is local search with random restarts. A heuristic based on the expected number of detections obtains solutions within 2% of the best known for each one-, two-, and three-searcher test problem considered. For one- and two-searcher problems, the same heuristic's solution time is less than that of other heuristics. For three-searcher problems, a genetic algorithm implementation obtains the best-known solution in as little as 20% of other heuristic solution times. © 1996 John Wiley & Sons, Inc. 相似文献
279.
Israel David 《海军后勤学研究》2001,48(4):259-269
This work highlights the problem in military operations of setting safety limits for friendly forces, neutral forces, or civilians, to avoid sustaining unnecessary casualties both in wartime and in training. We present and investigate an analytic model which both enables the quantitative understanding of the inherent problems, and which furnishes a reasonably flexible tool in the hands of the analyst. Characteristic numerical results are displayed and analyzed: They show in particular that prevailing crude approximations are inadequate. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 259–269, 2001 相似文献
280.
The paper addresses the problem of a patrol trying to stop smugglers who are attempting to ship a cargo of perishable contraband across a strait in one of M time units. The situation was modeled as a two-person zero-sum game of exhaustion by Thomas and Nisgav and this article extends their results. The game has many characteristics in common with the Inspection Game in Owen's book on Game Theory; this Inspection Game is generalized and the relations between the two games are discussed. 相似文献