全文获取类型
收费全文 | 741篇 |
免费 | 18篇 |
出版年
2021年 | 11篇 |
2019年 | 15篇 |
2018年 | 8篇 |
2017年 | 19篇 |
2016年 | 13篇 |
2015年 | 14篇 |
2014年 | 18篇 |
2013年 | 134篇 |
2012年 | 7篇 |
2010年 | 10篇 |
2009年 | 17篇 |
2007年 | 11篇 |
2006年 | 10篇 |
2005年 | 11篇 |
2004年 | 16篇 |
2002年 | 17篇 |
2001年 | 9篇 |
2000年 | 11篇 |
1999年 | 7篇 |
1998年 | 15篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 11篇 |
1994年 | 17篇 |
1993年 | 16篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 20篇 |
1987年 | 20篇 |
1986年 | 20篇 |
1985年 | 12篇 |
1984年 | 13篇 |
1983年 | 9篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 15篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 8篇 |
1974年 | 10篇 |
1973年 | 11篇 |
1972年 | 11篇 |
1971年 | 6篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1967年 | 6篇 |
排序方式: 共有759条查询结果,搜索用时 31 毫秒
151.
The first problem considered in this paper is concerned with the assembly of independent components into parallel systems so as to maximize the expected number of systems that perform satisfactorily. Associated with each component is a probability of it performing successfully. It is shown that an optimal assembly is obtained if the reliability of each assembled system can be made equal. If such equality is not attainable, then bounds are given so that the maximum expected number of systems that perform satisfactorily will lie within these stated bounds; the bounds being a function of an arbitrarily chosen assembly. An improvement algorithm is also presented. A second problem treated is concerned with the optimal design of a system. Instead of assembling given units, there is an opportunity to “control” their quality, i.e., the manufacturer is able to fix the probability, p, of a unit performing successfully. However, his resources, are limited so that a constraint is imposed on these probabilities. For (1) series systems, (2) parallel systems, and (3) k out of n systems, results are obtained for finding the optimal p's which maximize the reliability of a single system, and which maximize the expected number of systems that perform satisfactorily out of a total assembly of J systems. 相似文献
152.
This paper considers the problem of defending a set of point targets of differing values. The defense is proportional in that it forces the offense to pay a price, in terms of reentry vehicles expended, that is proportional to the value of the target. The objective of the defense is to balance its resources so that no matter what attack is launched, the offense will have to pay a price greater than or equal to some fixed value for every unit of damage inflicted. The analysis determines which targets should be defended and determines the optimal firing doctrine for interceptors at defended targets. A numerical example is included showing the relationship between the total target damage and the size of the interceptor force for different values of p, the interceptor single shot kill probability. Some generalizations are discussed. 相似文献
153.
This paper treats the problem of sequencing n jobs on two machines in a “flow shop.” (That is, each job in the shop is required to flow through the same sequence of the machines.) The processing time of a given job on a given machine is assumed to be distributed exponentially, with a known mean. The objective is to minimize the expected job completion time. This paper proves an optimal ordering rule, previously conjectured by Talwar [10]. A formula is also derived through Markov Chain analysis, which evaluates the expected job completion time for any given sequence of the jobs. In addition, the performance of a heuristic rule is discussed in the light of the optimal solution. 相似文献
154.
Many optimization problems occur in both theory and practice when one has to optimize an objective function while an infinite number of constraints must be satisfied. The aim of this paper in to describe methods of handling such problems numerically in an effective manner. We also indicate a number of applications. 相似文献
155.
An inventory model in which future demand is affected by stockouts has been considered recently by B. L. Schwartz. Some generalizations of Schwartz's model are presented in this paper and properties of the optimal policies are determined. In the case of deterministic demand, a set-up cost is included and a mixture of backlogged and nonbacklogged orders is allowed during stockout. It is proved that the optimal policy entails either no stockout or continual stockout, depending on the values of three parameters. For stochastic demand, the effect of stockouts on demand density is postulated, the resulting optimal inventory policy is discussed, and an example involving an exponential density function is then analyzed in detail. 相似文献
156.
Many techniques of forecasting are based upon extrapolation from time series. While such techniques have useful applications, they entail strong assumptions which are not explicitly enunciated. Furthermore, the time series approach not based on an indigenous forecast principle. The first attack from the present point of view was initiated by S. S. Wilks. Of particular interest over a wide range of operational situations in reliability, for example, is the behavior of the extremes of the Weibull and Gumbel distributions. Here we formulate forecasters for the minima of various forms of these distributions. The forecasters are determined for minimization in mean square of the distance. From n original observations the forecaster provides the minimum of the next m observations when the original distribution is maintained. For each of the forecasters developed, tables of efficiency have been calculated and included in the appendix. An explicit example has been included for one of the forecasters. Its performance has been demonstrated by the use of Monte Carlo technique. The results indicate that the forecaster can be used in practice with satisfactory results. 相似文献
157.
A stochastically constrained optimal replacement model for capital equipment is constructed. Each piece of capital equipment, or machine, is characterized by its age and “utility” or “readiness” class. The readiness of a machine at any age is a stochastic function of its initial utility class and its age. The total discounted replacement cost of several replacement streams, each commencing with an initial machine, is minimized with respect to the replacement age and initial utility class of each machine, subject to a readiness constraint stating the lower bound on the expected number of machines in each utility class at any time. A general solution procedure is outlined and a specific case is solved in detail. 相似文献
158.
Alan J. Kaplan 《海军后勤学研究》1976,23(4):687-695
We address a single product, continuous review model with stationary Poisson demand. Such a model has been effectively studied when mean demand is known. However, we are concerned with managing new items for which only a Bayesian prior distribution on the mean is available. As demand occurs, the prior is updated and our control parameters are revised. These include the reorder point (R) and reorder quantity (Q). Deemer, taking a clue from some earlier RAND work, suggested using a model appropriate for known mean, but using a Compound Poisson distribution for demand rather than Poisson to reflect uncertainty about the mean. Brown and Rogers also used this approach but within a periodic review context. In this paper we show how to compute optimum reorder points for a special problem closely related to the problem of real interest. In terms of the real problem, subject to a qualification to be discussed, the reorder points found are upper bounds for the optimum. At the same time, the reorder points found can never exceed those found by the Compound Poisson (Deemer) approach. And they can be smaller than those found when there is no uncertainty about the mean. As a check, the Compound Poisson and proposed approach are compared by simulation. 相似文献
159.
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. 相似文献
160.