全文获取类型
收费全文 | 252篇 |
免费 | 3篇 |
出版年
2021年 | 3篇 |
2019年 | 3篇 |
2017年 | 4篇 |
2016年 | 3篇 |
2015年 | 4篇 |
2014年 | 2篇 |
2013年 | 62篇 |
2011年 | 2篇 |
2010年 | 2篇 |
2009年 | 2篇 |
2008年 | 3篇 |
2007年 | 3篇 |
2006年 | 2篇 |
2005年 | 4篇 |
2004年 | 2篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1996年 | 4篇 |
1995年 | 5篇 |
1994年 | 6篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 5篇 |
1986年 | 7篇 |
1985年 | 6篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 9篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1977年 | 4篇 |
1976年 | 2篇 |
1975年 | 5篇 |
1974年 | 6篇 |
1973年 | 6篇 |
1972年 | 5篇 |
1971年 | 8篇 |
1970年 | 3篇 |
1969年 | 5篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1948年 | 3篇 |
排序方式: 共有255条查询结果,搜索用时 140 毫秒
91.
Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
92.
Ebru K. Bish Thin‐Yin Leong Chung‐Lun Li Jonathan W. C. Ng David Simchi‐Levi 《海军后勤学研究》2001,48(5):363-385
We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP‐hard and develop a heuristic algorithm based on formulating the problem as an assignment problem. The effectiveness of the heuristic is analyzed from both worst‐case and computational points of view. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 363–385, 2001 相似文献
93.
94.
The joint problems of determining the optimal plant location and optimal input mix and plant size are addressed. The interrelationship between input substitutability and plant location is stressed. Conditions under which the location problem can be separated from the determination of the optimal input mix are developed for a number of problem variations. The stability of the optimal location in the face of changes in problem parameters is also discussed. It is demonstrated that consideration of input substitutability often makes the resulting problem no more difficult to solve than problem formulations in which the inherent input substitutability is ignored. 相似文献
95.
In a previous paper, the authors have introduced a class of multivariate lifetimes (MIFRA) which generalize the univariate lifetimes with increasing failure rate average (IFRA). They have also shown that this class satisfies many fundamental properties. In this paper it is shown that other concepts of multivariate IFRA do not satisfy all of these properties. Relationships between MIFRA and these other concepts are given. Finally, positive dependence implications with respect to these classes are also discussed. 相似文献
96.
Mary W. Cooper 《海军后勤学研究》1981,28(2):301-307
An algorithm is presented to gain postoptimality data about the family of nonlinear pure integer programming problems in which the objective function and constraints remain the same except for changes in the right-hand side of the constraints. It is possible to solve such families of problems simultaneously to give a global optimum for each problem in the family, with additional problems solved in under 2 CPU seconds. This represents a small fraction of the time necessary to solve each problem individually. 相似文献
97.
In this paper the effects of inspector error on a cost-based quality control system are investigated. The system examined is of a single sampling plan design involving several cost components. Both type I and type II inspector errors are considered. The model employs a process distribution, thus assuming that a stochastic process of some kind governs the quality of incoming lots. Optimal plan design is investigated under both error-free and error-prone inspection procedures and some comparisons are made. 相似文献
98.
The problem of determining the optimal inspection epoch is studied for reliability systems in which N components operate in parallel. Lifetime distribution is arbitrary, but known. The optimization is carried with respect to two cost factors: the cost of inspecting a component and the cost of failure. The inspection epochs are determined so that the expected cost of the whole system per time unit per cycle will be minimized. The optimization process depends in the general case on the whole failure history of the system. This dependence is characterized. The cases of Weibull lifetime distributions are elaborated and illustrated numerically. The characteristics of the optimal inspection intervals are studied theoretically. 相似文献
99.
A flow shop sequencing problem with ordered processing time matrices is considered. A convex property for the makespan sequences of such problems is discussed. On the basis of this property an efficient optimizing algorithm is presented. Although the proof of optimality has not been developed, several hundred problems were solved optimally with this procedure. 相似文献
100.
Much work has been done in search theory; however, very little effort has occurred where an object's presence at a location can be accepted when no object is present there. The case analyzed is of this type. The number of locations is finite, a single object is stationary at one location, and only one location is observed each step of the search. The object's location has a known prior probability distribution. Also known are the conditional probability of acceptance given the object's absence (small) and the conditional probability of rejection given the object's presence (not too large); these Probabilities remain fixed for all searching and locations. The class of sequential search policies which terminate the search at the first acceptance is assumed. A single two-part optimization criterion is considered. The search sequence is found which (i) minimizes the probability of obtaining n rejections in the first n steps for all n, and (ii) maximizes the probability that the first acceptance occurs within the first n steps and occurs at the object's location for all n. The optimum sequential search policy specifies that the next location observed is one with the largest posterior probability of the object's presence (evaluated after each step from Bayes Rule) and that the object is at the first location where acceptance occurs. Placement at the first acceptance seems appropriate when the conditional probability of acceptance given the object's absence is sufficiently small. Search always terminates (with probability one). Optimum truncated sequential policies are also considered. Methods are given for evaluating some pertinent properties and for investigating the possibility that no object occurs at any location. 相似文献