全文获取类型
收费全文 | 288篇 |
免费 | 12篇 |
国内免费 | 2篇 |
出版年
2021年 | 3篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 5篇 |
2017年 | 7篇 |
2016年 | 7篇 |
2015年 | 7篇 |
2014年 | 2篇 |
2013年 | 58篇 |
2011年 | 4篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 5篇 |
2005年 | 10篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 2篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 9篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 9篇 |
1995年 | 3篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 3篇 |
1989年 | 3篇 |
1987年 | 3篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1974年 | 5篇 |
1973年 | 2篇 |
1972年 | 8篇 |
1971年 | 5篇 |
1970年 | 8篇 |
1969年 | 4篇 |
1968年 | 4篇 |
1967年 | 5篇 |
1966年 | 3篇 |
排序方式: 共有302条查询结果,搜索用时 328 毫秒
61.
A mixed optimization technique for optimal machine replacement is presented which allows much more flexibility than previous models. Optimal purchase, maintenance and sale of a given machine between any two given points in time is treated as a subproblem, which one may choose to solve via control theory, dynamic programming, or practical engineering considerations. (A control theory formulation is used in the paper as an illustration.) These subproblem solutions are then incorporated into a Wagner-Whitin formulation for solution of the full problem. The technique is particularly useful for problems with such asymmetries as an existing initial machine or uneven technological change. A simple numerical example is solved in the Appendix. 相似文献
62.
The problem of determining multicommodity flows over a capacitated network subject to resource constraints may be solved by linear programming; however, the number of potential vectors in most applications is such that the standard arc-chain formulation becomes impractical. This paper describes an approach—an extension of the column generation technique used in the multicommodity network flow problem—that simultaneously considers network chain selection and resource allocation, thus making the problem both manageable and optimal. The flow attained is constrained by resource availability and network capacity. A minimum-cost formulation is described and an extension to permit the substitution of resources is developed. Computational experience with the model is discussed. 相似文献
63.
64.
65.
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. 相似文献
66.
Salah E. Elmaghraby 《海军后勤学研究》1968,15(1):23-32
Given n jobs and a single facility, and the fact that a subset of jobs are “related” to each other in such a manner that regardless of which job is completed first, its utility is hampered until all other jobs in the same subset are also completed, it is desired to determine the sequence which minimizes the cost of tardiness. The special case of pairwise relationship among all jobs is easily solved. An algorithm for the general case is given through a dynamic programming formulation. 相似文献
67.
Several approximate procedures are available in the literature for obtaining confidence intervals for the parameter A of an exponential distribution based on time truncated samples. This paper contains the results of an empirical study comparing three of these procedures. 相似文献
68.
69.
The objective of this article is to describe heuristic solutions to the problem of modeling inventories at each node of a large network in the context of a computer simulation model of that network. The heuristic solutions are compared with the mathematical solution which is too unwieldy for use in a simulation model. The Weibull cumulative distribution is used as an approximation for the heuristic models. We question whether the good performance of the Weibull is coincidence or perhaps mathematically justifiable. 相似文献
70.