全文获取类型
收费全文 | 264篇 |
免费 | 5篇 |
出版年
2019年 | 8篇 |
2018年 | 10篇 |
2017年 | 4篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 8篇 |
2013年 | 71篇 |
2012年 | 2篇 |
2011年 | 3篇 |
2009年 | 4篇 |
2007年 | 2篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1998年 | 3篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 3篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 6篇 |
1973年 | 4篇 |
1972年 | 5篇 |
1971年 | 5篇 |
1970年 | 3篇 |
1969年 | 6篇 |
1968年 | 3篇 |
1966年 | 1篇 |
1948年 | 1篇 |
排序方式: 共有269条查询结果,搜索用时 15 毫秒
111.
We consider the multiperiod lot-sizing problem in which the production yield (the proportion of usable goods) is variable according to a known probability distribution. We review two economic order quantity (EOQ) models for the stationary demand continuous-time problem and derive an EOQ model when the production yield follows a binomial distribution and backlogging of demand is permitted. A dynamic programming algorithm for an arbitrary sequence of demand requirements is presented. Heuristics based on both the EOQ model and appropriate modification of the underlying perfect-yield lot-sizing policies are discussed, and extensive computational evaluation of these heuristics is presented. Two of these heuristics are then modified to include the notion of supply safety stock. The modified heuristics consistently produce near-optimal lot-sizing policies for problems with stationary and time-varying demands. 相似文献
112.
Warren B. Powell 《海军后勤学研究》1987,34(2):207-227
Procedures are developed for numerically calculating the waiting-time distribution for bulk arrival, bulk service queues operated under a vehicle-cancellation or a vehicle-holding strategy, as well as for queues where vehicles depart regardless of the length of the queue. Experiments indicate that the mean and variance of the calculated distribution agree very closely with analytical expressions obtained from transforms. The results can be used to study the service reliability of different dispatching strategies. Alternatively, the results may be used to evaluate simpler approximations for the higher moments. 相似文献
113.
C. B. Millham 《海军后勤学研究》1974,21(2):307-317
This work considers a class of bimatrix games to which some well-known structure theorems of 0-sum matrix games can be made to generalize. It is additionally shown how to construct such games and how to generate the equilibrium points defining a given game as a member of that class. 相似文献
114.
This work is concerned with constructing, analyzing, and finding “mobility chains” for bimatrix games, sequences of equilibrium points along which it is possible for the two players to progress, one equilibrium point at a time, to an equilibrium point that is preferred by both players. The relationship between mobility chains and Nash subsets is established, and some properties of maximal Nash subsets are proved. 相似文献
115.
The dual linear programs associated with finite statistical games are investigated and their optimal solutions are interpreted. The usual statistical game is generalized to a two-sided (inference) game and its possible application as a tactical model is discussed. 相似文献
116.
Ram B. Misra 《海军后勤学研究》1979,26(1):161-165
This paper develops a discounted-cost model that is similar to the classical economic order quantity model but includes inflation rates as parameters of the inventory system. A numerical problem is solved to illustrate the effects. 相似文献
117.
A single machine scheduling problem in which both the processing times and due-dates of the jobs awaiting servicing are random variables is analyzed. It is proved that the properties of the shortest processing time rule and the due-date rule which are known for the deterministic situation also hold in the probabilistic environment when they are suitably, and reasonably, refined for this context. 相似文献
118.
William P. Pierskalla 《海军后勤学研究》1969,16(2):217-228
A stochastic single product convex cost inventory problem is considered in which there is a probability, πj, that the product will become obsolete in the future period j. In an interesting paper, Barankin and Denny essentially formulate the model, but do not describe some of its interesting and relevant ramifications. This paper is written not only to bring out some of these ramifications, but also to describe some computational results using this model. The computational results show that if obsolescence is a distinct possibility in the near future, it is quite important that the probabilities of obsolescence be incorporated into the model before computing the optimal policies. 相似文献
119.
A hypothetical port facility in a theatre of operations is modeled and coded in a special purpose simulation language, for the purpose of conducting simulation experiments on a digital computer. The experiments are conducted to investigate the resource requirements necessary for the reception, discharge, and clearance of supplies at the port. Queue lengths, waiting times, facility utilizations, temporary storage levels, and ship turn-around times are analyzed as functions of transportation and cargo handling resources, using response surface methodology. The resulting response surfaces are revealing in regard to the sensitivity of port operations to transportation resource levels and the characteristics of the port facility's load factor. Two specific conclusions of significant value are derived. First, the simulation experiments clearly show that the standard procedures for determining discharge and clearance capacities take insufficient account of the effects of variability. Second, the response surfaces for ship turn-around times and temporary storage levels indicate that an extremely steep gradient exists as a function of troop levels. 相似文献
120.