全文获取类型
收费全文 | 453篇 |
免费 | 17篇 |
出版年
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 7篇 |
2017年 | 8篇 |
2016年 | 10篇 |
2015年 | 9篇 |
2014年 | 8篇 |
2013年 | 80篇 |
2011年 | 5篇 |
2009年 | 5篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 4篇 |
2004年 | 9篇 |
2003年 | 4篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 5篇 |
1999年 | 8篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 9篇 |
1995年 | 12篇 |
1994年 | 12篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 11篇 |
1990年 | 8篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 11篇 |
1986年 | 4篇 |
1985年 | 12篇 |
1984年 | 9篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 6篇 |
1979年 | 12篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 8篇 |
1974年 | 7篇 |
1973年 | 7篇 |
1972年 | 8篇 |
1971年 | 6篇 |
1969年 | 3篇 |
1968年 | 6篇 |
1967年 | 5篇 |
排序方式: 共有470条查询结果,搜索用时 15 毫秒
21.
A method is developed for determining the optimal policy for entry of customers from many independent classes of Poisson arrivals to a first-come, first-serve (for customers admitted to the queue) single-server queue with exponential service times. The solution technique utilizes a semi-Markov formulation or the decision problem. 相似文献
22.
23.
24.
Robert C. Leachman 《海军后勤学研究》1982,29(1):47-54
Production planning for large-scale production systems requiring the allocation of numerous resources is considered. It is demonstrated how the dynamic activity analysis developed by Shephard leads to linear programming solutions of production planning problems. Three types of planning problems are formulated: maximization of output levels for a given time horizon; minimization of production duration for given output histories; and minimization of production costs for given output histories. 相似文献
25.
New closure theorems for shock models in reliability theory are presented. If the number of shocks to failure and the times between the arrivals of shocks have probability distributions of phase type, then so has the time to failure. PH-distributions are highly versatile and may be used to model many qualitative features of practical interest. They are also well-suited for algorithmic implementation. The computational aspects of our results are discussed in some detail. 相似文献
26.
We formulate the set partitioning problem as a matching problem with simple side constraints. As a result we obtain a Lagrangian relaxation of the set partitioning problem in which the primal problem is a matching problem. To solve the Lagrangian dual we must solve a sequence of matching problems each with different edge-weights. We use the cyclic coordinate method to iterate the multipliers, which implies that successive matching problems differ in only two edge-weights. This enables us to use sensitivity analysis to modify one optimal matching to obtain the next one. We give theoretical and empirical comparisons of these dual bounds with the conventional linear programming ones. 相似文献
27.
We study via simulation an M/M/1 queueing system with the assumption that a customer's service time and the interarrival interval separating his arrival from that of his predecessor are correlated random variables having a bivariate exponential distribution. We show that positive correlation reduces the mean and variance of the total waiting time and that negative correlation has the opposite effect. By using spectral analysis and a nonparametric test applied to the sample power spectra associated with certain simulated waiting times we show the effect to be statistically significant. 相似文献
28.
This paper reconsiders the classical model for selling an asset in which offers come in daily and a decision must then be made as to whether or not to sell. For each day the item remains unsold a continuation (or maintenance cost) c is incurred. The successive offers are assumed to be independent and identically distributed random variables having an unknown distribution F. The model is considered both in the case where once an offer is rejected it may not be recalled at a later time and in the case where such recall of previous offers is allowed. 相似文献
29.
In this paper we discuss the properties of a Bilinear Programming problem, and develop a convergent cutting plane algorithm. The cuts involve only a subset of the variables and preserve the special structure of the constraints involving the remaining variables. The cuts are deeper than other similar cuts. 相似文献
30.
An explicit steady state solution is determined for the distribution of the number of customers for a queueing system in which Poisson arrivals are bulks of random size. The number of customers per bulk varies randomly between 1 and m, m arbitrary, according to a point multinomial, and customer service is exponential. Queue characteristics are given. 相似文献