全文获取类型
收费全文 | 491篇 |
免费 | 7篇 |
出版年
2021年 | 4篇 |
2019年 | 9篇 |
2018年 | 12篇 |
2017年 | 8篇 |
2016年 | 10篇 |
2015年 | 5篇 |
2014年 | 6篇 |
2013年 | 120篇 |
2010年 | 7篇 |
2008年 | 7篇 |
2006年 | 3篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 3篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1996年 | 11篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 9篇 |
1992年 | 8篇 |
1991年 | 11篇 |
1990年 | 7篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 13篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 12篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1972年 | 6篇 |
1971年 | 11篇 |
1970年 | 6篇 |
1969年 | 7篇 |
1968年 | 7篇 |
1967年 | 5篇 |
1966年 | 7篇 |
排序方式: 共有498条查询结果,搜索用时 15 毫秒
101.
Jatinder N. D. Gupta 《海军后勤学研究》1975,22(2):255-269
This paper considers the problem of scheduling a given number of jobs on a specified number of machines in a flowshop where the objective function is to minimize the total throughput time in which all jobs complete processing on all machines. Based on the combinatorial analysis of the problem, several simple algorithms are developed for solving special structure flowshop scheduling problems where the process times are not completely random, but bear a well-defined relationship to one another. The proposed algorithms are both simple and computationally efficient and can optimally solve large-sized problems even with manual computational devices. 相似文献
102.
Lawrence D. Stone 《海军后勤学研究》1973,20(3):419-430
This paper considers the problem of finding optimal solutions to a class of separable constrained extremal problems involving nonlinear functionals. The results are proved for rather general situations, but they may be easily stated for the case of search for a stationary object whose a priori location distribution is given by a density function on R, a subset of Euclidean n-space. The functional to be optimized in this case is the probability of detection and the constraint is on the amount of effort to be used Suppose that a search of the above type is conducted in such a manner as to produce the maximum increase in probability of detection for each increment of effort added to the search. Then under very weak assumptions, it is proven that this search will produce an optimal allocation of the total effort involved. Under some additional assumptions, it is shown that any amount of search effort may be allocated in an optimal fashion. 相似文献
103.
In this paper a very versatile game model is developed for use in the long range planning of our strategic force posture. This highly aggregate model yields optimal force mixes for the triad (land- and sea-based missile systems and bombers) under a variety of constraints. The model described here is a survivability model; however, it is shown how the model can still be used as a measure of overall system effectiveness. Constraints imposed on the problem include both SALT and budget limitations. 相似文献
104.
The literature on maintenance models is surveyed. The focus is on work appearing since the 1965 survey, “Maintenance Policies for Stochastically Failing Equipment: A Survey” by John McCall and the 1965 book, The Mathematical Theory of Reliability, by Richard Barlow and Frank Proschan. The survey includes models which involve an optimal decision to procure, inspect, and repair and/or replace a unit subject to deterioration in service. 相似文献
105.
The problem of finding minimal disconnecting sets for multi-commodity directed networks may be solved using an arc-path formulation and Gomory's all-integer integer programming algorithm. However, the number of network constraints may be astronomical for even moderately sized networks. This paper develops a finite algorithm similar to Gomory's, but requiring no more than m rows in the tableau, where m is the number of arcs in the network. 相似文献
106.
John A. Finchum 《海军后勤学研究》1972,19(2):389-397
The application of statistical expectation to risk density functions and fee/incentive-element relationships is shown to be useful in structuring contract incentives. A mathematical procedure for calculating the expected value of fee for a given risk/incentive arrangement is described along with cost examples and related sensitivity analyses. The structuring of equivalent incentives is demonstrated by the use of the contracting procedure used for procuring the C-5A aircraft. 相似文献
107.
Michael D. Yaffe 《Defense & Security Analysis》1989,5(2):163-166
Strategy, Politics and Defense Budgets. By Warner R. Schilling, Paul Y. Hammond and Glenn H. Snyder. Columbia University Press, New York (1962) 相似文献
108.
Let , where A (t)/t is nondecreasing in t, {P(k)1/k} is nonincreasing. It is known that H(t) = 1 — H (t) is an increasing failure rate on the average (IFRA) distribution. A proof based on the IFRA closure theorem is given. H(t) is the distribution of life for systems undergoing shocks occurring according to a Poisson process where P (k) is the probability that the system survives k shocks. The proof given herein shows there is an underlying connection between such models and monotone systems of independent components that explains the IFRA life distribution occurring in both models. 相似文献
109.
The problem of computing reliability and availability and their associated confidence limits for multi-component systems has appeared often in the literature. This problem arises where some or all of the component reliabilities and availabilities are statistical estimates (random variables) from test and other data. The problem of computing confidence limits has generally been considered difficult and treated only on a case-by-case basis. This paper deals with Bayes confidence limits on reliability and availability for a more general class of systems than previously considered including, as special cases, series-parallel and standby systems applications. The posterior distributions obtained are exact in theory and their numerical evaluation is limited only by computing resources, data representation and round-off in calculations. This paper collects and generalizes previous results of the authors and others. The methods presented in this paper apply both to reliability and availability analysis. The conceptual development requires only that system reliability or availability be probabilities defined in terms acceptable for a particular application. The emphasis is on Bayes Analysis and the determination of the posterior distribution functions. Having these, the calculation of point estimates and confidence limits is routine. This paper includes several examples of estimating system reliability and confidence limits based on observed component test data. Also included is an example of the numerical procedure for computing Bayes confidence limits for the reliability of a system consisting of N failure independent components connected in series. Both an exact and a new approximate numerical procedure for computing point and interval estimates of reliability are presented. A comparison is made of the results obtained from the two procedures. It is shown that the approximation is entirely sufficient for most reliability engineering analysis. 相似文献
110.
The reliability of a serial production line is optimized with respect to the location of a single buffer. The problem was earlier defined and solved by Soyster and Toof for the special case of an even number of machines all having equal probability of failure. In this paper we generalize the results for any number of machines and remove the restriction of identical machine reliabilities. In addition, an analysis of multibuffer systems is presented with a closed form solution for the reliability when both the number of buffers and their capacity is limited. For the general multibuffer system we present an approach for determining system reliability. 相似文献