全文获取类型
收费全文 | 275篇 |
免费 | 10篇 |
出版年
2021年 | 4篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2014年 | 8篇 |
2013年 | 52篇 |
2011年 | 2篇 |
2010年 | 4篇 |
2009年 | 6篇 |
2008年 | 3篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 5篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 4篇 |
1993年 | 8篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 12篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 9篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 7篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 6篇 |
1973年 | 2篇 |
1972年 | 2篇 |
1971年 | 8篇 |
1970年 | 4篇 |
1969年 | 4篇 |
1967年 | 2篇 |
排序方式: 共有285条查询结果,搜索用时 15 毫秒
241.
One approach to the evaluation of the performance of multiprogranmed computer systems includes the development of Monte Carlo simulations of transitions of programs within such systems, and their strengthening by control variable and concomitant variable methods. An application of such a combination of analytical, numerical, and Monte Carlo approaches to a model of system overhead in a paging machine is presented. 相似文献
242.
The historic max-min problem is examined as a discrete process rather than in its more usual continuous mode. Since the practical application of the max-min model usually involves discrete objects such as ballistic missiles, the discrete formulation of the problem seems quite appropriate. This paper uses an illegal modification to the dynamic programming process to obtain an upper bound to the max-min value. Then a second but legal application of dynamic programming to the minimization part of the problem for a fixed maximizing vector will give a lower bound to the max-min value. Concepts of optimal stopping rules may be applied to indicate when sufficiently near optimal solutions have been obtained. 相似文献
243.
Gordon P. Wright 《海军后勤学研究》1968,15(3):375-401
The objective of this paper is to determine the optimum inventory policy for a multi-product periodic review dynamic inventory system. At the beginning of each period two decisions are made for each product. How much to “normal order” with a lead time of λn periods and how much to “emergency order” with a lead time of λe periods, where λe = λn - 1. It is assumed that the emergency ordering costs are higher than the normal ordering costs. The demands for each product in successive periods are assumed to form a sequence of independent identically distributed random variables with known densities. Demands for individual products within a period are assumed to be non-negative, but they need not be independent. Whenever demand exceeds inventory their difference is backlogged rather than lost. The ordering decisions are based on certain costs and two revenue functions. Namely, the procurement costs which are assumed to be linear for both methods of ordering, convex holding and penalty costs, concave salvage gain functions, and linear credit functions. There is a restriction on the total amount that can be emergency ordered for all products. The optimal ordering policy is determined for the one and N-period models. 相似文献
244.
The problem posed in this paper is to sequence or route n jobs, each originating at a particular location or machine, undergoing r?1 operations or repairs, and terminating at the location or machine from which it originated. The problem is formulated as a 0-1 integer program, with block diagonal structure, comprised of r assignment subproblems; and a joint set of constraints to insure cyclical squences. To obtain integer results the solutions to each subproblem are ranked as required and combinations thereof are implicitly enumerated. The procedure may be terminated at any step to obtain an approximate solution. Some limited computational results are presented. 相似文献
245.
Daniel P. Heyman 《海军后勤学研究》1977,24(3):385-405
We consider a single-item inventory system in which the stock level can increase due to items being returned as well as decrease when demands occur. Returned items can be repaired and then used to satisfy future demand, or they can be disposed of. We identify those inventory levels where disposal is the best policy. It is shown that this problem is equivalent to a problem of controlling a single-server queue. When the return and demand processes are both Poisson, we find the optimal policy exactly. When the demand and return processes are more general, we use diffusion approximations to obtain an approximate model, which is then solved. The approximate model requires only mean and variance data. Besides the optimal policy, the output of the models includes such characteristics as the operating costs, the purchase rate for new items, the disposal rate for returned items and the average inventory level. Several numerical examples are given. An interesting by-product of our investigation is an approximation for the steady-state behavior of the bulk GI/G/1 queue with a queue limit. 相似文献
246.
247.
The dynamic transportation problem is a transportation problem over time. That is, a problem of selecting at each instant of time t, the optimal flow of commodities from various sources to various sinks in a given network so as to minimize the total cost of transportation subject to some supply and demand constraints. While the earliest formulation of the problem dates back to 1958 as a problem of finding the maximal flow through a dynamic network in a given time, the problem has received wider attention only in the last ten years. During these years, the problem has been tackled by network techniques, linear programming, dynamic programming, combinational methods, nonlinear programming and finally, the optimal control theory. This paper is an up-to-date survey of the various analyses of the problem along with a critical discussion, comparison, and extensions of various formulations and techniques used. The survey concludes with a number of important suggestions for future work. 相似文献
248.
This paper deals with a periodic review inventory system in which a constant proportion of stock issued to meet demand each period feeds back into the inventory after a fixed number of periods. Various applications of the model are discussed, including blood bank management and the control of reparable item inventories. We assume that on hand inventory is subject to proportional decay. Demands in successive periods are assumed to be independent identically distributed random variables. The functional equation defining an optimal policy is formulated and a myopic base stock approximation is developed. This myopic policy is shown to be optimal for the case where the feedback delay is equal to one period. Both cost and ordering decision comparisons for optimal and myopic policies are carried out numerically for a delay time of two periods over a wide range of input parameter values. 相似文献
249.
An inventory of physical goods or storage space (in a communications system buffer, for instance) often experiences “all or nothing” demand: if a demand of random size D can be immediately and entirely filled from stock it is satisfied, but otherwise it vanishes. Probabilistic properties of the resulting inventory level are discussed analytically, both for the single buffer and for multiple buffer problems. Numerical results are presented. 相似文献
250.
Periodic mass screening is the scheduled application of a test to all members of a population to provide early detection of a randomly occurring defect or disease. This paper considers periodic mass screening with particular reference to the imperfect capacity of the test to detect an existing defect and the associated problem of selecting the kind of test to use. Alternative kinds of tests differ with respect to their reliability characteristics and their cost per application. Two kinds of imperfect test reliability are considered. In the first case, the probability that the test will detect an existing defect is constant over all values of elapsed time since the incidence of the defect. In the second case, the test will detect the defect if, and only if, the lapsed time since incidence exceeds a critical threshold T which characterizes the test. The cost of delayed detection is an arbitrary increasing function (the “disutility function”) of the duration of the delay. Expressions for the long-run expected disutility per unit time are derived for the above two cases along with results concerning the best choice of type of test (where the decision rules make reference to characteristics of the disutility function). 相似文献