全文获取类型
收费全文 | 1000篇 |
免费 | 20篇 |
出版年
2021年 | 13篇 |
2019年 | 21篇 |
2018年 | 9篇 |
2017年 | 23篇 |
2016年 | 19篇 |
2015年 | 18篇 |
2014年 | 18篇 |
2013年 | 209篇 |
2012年 | 9篇 |
2010年 | 12篇 |
2009年 | 15篇 |
2007年 | 18篇 |
2006年 | 11篇 |
2005年 | 13篇 |
2004年 | 15篇 |
2003年 | 14篇 |
2002年 | 16篇 |
2000年 | 10篇 |
1999年 | 11篇 |
1998年 | 17篇 |
1997年 | 14篇 |
1996年 | 16篇 |
1995年 | 10篇 |
1994年 | 24篇 |
1993年 | 25篇 |
1992年 | 16篇 |
1991年 | 24篇 |
1990年 | 11篇 |
1989年 | 13篇 |
1987年 | 11篇 |
1986年 | 30篇 |
1985年 | 22篇 |
1984年 | 12篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 15篇 |
1980年 | 15篇 |
1979年 | 19篇 |
1978年 | 19篇 |
1977年 | 10篇 |
1976年 | 12篇 |
1975年 | 11篇 |
1974年 | 19篇 |
1973年 | 14篇 |
1972年 | 15篇 |
1971年 | 16篇 |
1970年 | 16篇 |
1969年 | 14篇 |
1968年 | 10篇 |
1967年 | 11篇 |
排序方式: 共有1020条查询结果,搜索用时 15 毫秒
61.
Under a free-replacement warranty of duration W, the customer is provided, for an initial cost of C, as many replacement items as needed to provide service for a period W. Payments of C are not made at fixed intervals of length W, but in random cycles of length Y = W + γ(W), where γ(W) is the (random) remaining life-time of the item in service W time units after the beginning of a cycle. The expected number of payments over the life cycle, L, of the item is given by MY(L), the renewal function for the random variable Y. We investigate this renewal function analytically and numerically and compare the latter with known asymptotic results. The distribution of Y, and hence the renewal function, depends on the underlying failure distribution of the items. Several choices for this distribution, including the exponential, uniform, gamma and Weibull, are considered. 相似文献
62.
The classical Economic Order Quantity Model requires the parameters of the model to be constant. Some EOQ models allow a single parameter to change with time. We consider EOQ systems in which one or more of the cost or demand parameters will change at some time in the future. The system we examine has two distinct advantages over previous models. One obvious advantage is that a change in any of the costs is likely to affect the demand rate and we allow for this. The second advantage is that often, the times that prices will rise are fairly well known by announcement or previous experience. We present the optimal ordering policy for these inventory systems with anticipated changes and a simple method for computing the optimal policy. For cases where the changes are in the distant future we present a myopic policy that yields costs which are near-optimal. In cases where the changes will occur in the relatively near future the optimal policy is significantly better than the myopic policy. 相似文献
63.
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. 相似文献
64.
J. G. Shanthikumar 《海军后勤学研究》1979,26(2):305-309
This paper discusses a class of queueing models in which the service time of a customer al a single server facility is dependent on the queue size at the onset of its service. The Laplace transform for the wait in queue distribution is derived and the utilization of the server is given when the arrival is a homogeneous Poisson process. 相似文献
65.
About thirty references that feature naval logistics environments are considered. All are unclassified and all appear in the open literature or are available from the Defense Logistics Studies Information Exchange. Three approaches are identified–data analysis, theoretical models, and readiness indexes–and conclusions are presented as to possibilities for answering two questions: (a) Can the unit do the job? (b) How does readiness depend on resources? Four cases are treated in detail to illustrate methodology. 相似文献
66.
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. 相似文献
67.
The problem of multiple-resource capacity planning under an infinite time horizon is analyzed using a nonlinear programming model. The analysis generalizes to the long term the short-run pricing model for computer networks developed in Kriebel and Mikhail [5]. The environment assumes heterogeneous resource capacities by age (vingate), which service a heterogeneous and relatively captive market of users with known demand functions in each time period. Total variable operating costs are given by a continuous psuedoconcave function of system load, capacity, and resource age. Optimal investment, pricing, and replacement decision rules are derived in the presence of economies of scale and exogenous technological progress. Myopic properties of the decision rules which define natural (finite) planning subhorizons are discussed. 相似文献
68.
The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems. 相似文献
69.
70.
Variations of Hale's channel assignment problem, the L(j, k)‐labeling problem and the radio labeling problem require the assignment of integers to the vertices of a graph G subject to various distance constraints. The λj,k‐number of G and the radio number of G are respectively the minimum span among all L(j, k)‐labelings, and the minimum span plus 1 of all radio labelings of G (defined in the Introduction). In this paper, we establish the λj,k‐number of ∏ K for pairwise relatively prime integers t1 < t2 < … < tq, t1 ≥ 2. We also show the existence of an infinite class of graphs G with radio number |V(G)| for any diameter d(G). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献