全文获取类型
收费全文 | 731篇 |
免费 | 17篇 |
出版年
2021年 | 7篇 |
2019年 | 17篇 |
2018年 | 13篇 |
2017年 | 17篇 |
2016年 | 16篇 |
2015年 | 15篇 |
2013年 | 134篇 |
2011年 | 9篇 |
2010年 | 7篇 |
2009年 | 10篇 |
2008年 | 7篇 |
2007年 | 8篇 |
2006年 | 8篇 |
2005年 | 16篇 |
2004年 | 14篇 |
2003年 | 9篇 |
2000年 | 10篇 |
1999年 | 9篇 |
1998年 | 7篇 |
1997年 | 11篇 |
1996年 | 20篇 |
1995年 | 6篇 |
1994年 | 16篇 |
1993年 | 9篇 |
1992年 | 11篇 |
1991年 | 24篇 |
1990年 | 9篇 |
1989年 | 17篇 |
1988年 | 9篇 |
1987年 | 17篇 |
1986年 | 18篇 |
1985年 | 22篇 |
1984年 | 12篇 |
1983年 | 9篇 |
1982年 | 7篇 |
1981年 | 9篇 |
1980年 | 13篇 |
1979年 | 10篇 |
1978年 | 10篇 |
1977年 | 13篇 |
1976年 | 12篇 |
1975年 | 7篇 |
1974年 | 16篇 |
1973年 | 10篇 |
1972年 | 17篇 |
1971年 | 17篇 |
1970年 | 10篇 |
1969年 | 10篇 |
1968年 | 9篇 |
1967年 | 8篇 |
排序方式: 共有748条查询结果,搜索用时 31 毫秒
151.
152.
Multi-echelon logistic systems are essential parts of the service support function of high technology firms. The combination of technological developments and competitive pressures has led to the development of services systems with a unique set of characteristics. These characteristics include (1) low demand probabilities: (2) high cost items; (3) complex echelon structures; (4) existence of pooling mechanisms among stocking locations at the same echelon level; (5) high priority for service, which is often expressed in terms of response time service levels for product groups of items: (6) scrapping of failed parts; and (7) recycling of issued stock due to diagnostic use. This article develops a comprehensive model of a stochastic, multi-echelon inventory system that takes account of the above characteristics. Solutions to the constrained optimization problem are found using a branch and bound procedure. The results of applying this procedure to a spare parts inventory system for a computer manufacturer have led to a number of important policy conclusions. 相似文献
153.
This article presents a branch and bound method for solving the problem of minimizing a separable concave function over a convex polyhedral set where the variables are restricted to be integer valued. Computational results are reported. 相似文献
154.
Craig A. Tovey 《海军后勤学研究》1986,33(4):717-724
We consider the problem of rescheduling n jobs to minimize the makespan on m parallel identical processors when m changes value. We show this problem to be NP-hard in general. Call a list schedule totally optimal if it is optimal for all m = 1, …,n. When n is less than 6, there always exists a totally optimal schedule, but for n ≥ 6 this can fail. We show that an exact solution is less robust than the largest processing time first (LPT) heuristic and discuss implications for polynomial approximation schemes and hierarchical planning models. 相似文献
155.
Consider a fleet of vehicles comprised of K1 identical tankers and K2 identical nontankers (small aircraft). Tankers are capable of refueling other tankers as well as nontankers. The problem is to find that refueling sequence of the tankers that maximizes the range simultaneously attainable by all K2 nontankers. A recent paper established that the “unit refueling sequence,” comprised of one tanker refueling at each of K1 refueling operations, is optimal. The same paper also proffered the following conjecture for the case that the number of refueling operations is constrained to be less than the number of tankers: A nonincreasing refueling sequence is optimal. This article proves the conjecture. 相似文献
156.
George E. Monahan 《海军后勤学研究》1986,33(2):293-307
This article examines the problem of optimally selecting from several unknown rewards when there are given alternative, costly sources of information. The optimal rule, indicating the information to be purchased and the reward to be selected, is specified as a function of the decision maker's prior probabilities regarding the value of each alternative. The rule is surprisingly complex, balancing prior beliefs, the “informativeness” of the relevant information system, and the cost of acquiring information. 相似文献
157.
J. E. Angus 《海军后勤学研究》1986,33(3):385-390
An alternating renewal process starts at time zero and visits states 1,2,…,r, 1,2, …,r 1,2, …,r, … in sucession. The time spent in state i during any cycle has cumulative distribution function Fi, and the sojourn times in each state are mutually independent, positive and nondegenerate random variables. In the fixed time interval [0,T], let Ui(T) denote the total amount of time spent in state i. In this note, a central limit theorem is proved for the random vector (Ui(T), 1 ≤ i ≤ r) (properly normed and centered) as T → ∞. 相似文献
158.
Discussed in this article are tests for the extreme-value distribution, or, equivalently, for the two-parameter Weibull distribution when parameters are unknown and the sample may be censored. The three tests investigated are based on the median, the mean, and the Anderson-Darling A2 statistic calculated from a set zi of values derived from the spacings of the sample. The median and the mean have previously been discussed by Mann, Scheuer, and Fertig [10] and by Tiku and Singh [14]. Asymptotic distributions and points are given for the test statistics, based on recently developed theory, and power studies are conducted to compare them with each other and with two other statistics suitable for the test. Of the normalized spacings tests, A2 is recommended overall; the mean also gives good power in many situations, but can be nonconsistent. 相似文献
159.
We consider the optimal replacement problem for a fault tolerant system comprised of N components. The components are distingushable, and the state of the system is given by knowing exactly which components are operationl and which have failed. The individual component failure rates depend on the state of the entire system. We assume that the rate at which the system produces income decreases as the system deteriorates and the system replacement cost rises. Individual components cannot be replaced. We give a greedy-type algorithm that produces the replacement policy that maximizes the long-run net system income per unit time. 相似文献
160.