全文获取类型
收费全文 | 730篇 |
免费 | 17篇 |
出版年
2021年 | 11篇 |
2019年 | 27篇 |
2018年 | 15篇 |
2017年 | 14篇 |
2016年 | 13篇 |
2015年 | 12篇 |
2014年 | 13篇 |
2013年 | 136篇 |
2009年 | 7篇 |
2008年 | 10篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 11篇 |
2004年 | 12篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 8篇 |
2000年 | 10篇 |
1998年 | 13篇 |
1997年 | 19篇 |
1996年 | 15篇 |
1995年 | 7篇 |
1994年 | 12篇 |
1992年 | 9篇 |
1991年 | 19篇 |
1990年 | 9篇 |
1989年 | 15篇 |
1988年 | 15篇 |
1987年 | 21篇 |
1986年 | 15篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 15篇 |
1979年 | 14篇 |
1978年 | 11篇 |
1977年 | 12篇 |
1976年 | 12篇 |
1975年 | 12篇 |
1974年 | 10篇 |
1973年 | 14篇 |
1972年 | 9篇 |
1971年 | 13篇 |
1970年 | 10篇 |
1969年 | 8篇 |
1968年 | 10篇 |
1967年 | 8篇 |
1966年 | 9篇 |
排序方式: 共有747条查询结果,搜索用时 31 毫秒
221.
This paper deals with the problem of scheduling items (tasks, employees, equipment, etc.) over a finite time horizon so as to minimize total cost expenditures while maintaining a predefined separation between certain items. The problem is cyclic, because the same schedule will be repeated over several consecutive time periods of equal length. Thus, requirements are present to maintain the separation of items not only within the individual time periods considered, but also between items in adjoining periods. A special purpose branch-and-bound algorithm is developed to solve this scheduling problem by taking advantage of its cyclic nature. Computational results are given. 相似文献
222.
Results of Geoffrion for efficient and properly efficient solutions of multiobjective programming problems are extended to multiobjective fractional programming problems. Duality relationships are given for these problems where the functions are generalized convex or invex. 相似文献
223.
224.
This article deals with the problem of scheduling jobs with random processing times on single machine in order to minimize the expected variance of job completion times. Sufficient conditions for the existence of V-shaped optimal sequences are derived separately for general and ordered job processing times. It is shown that when coefficient of variation of random processing times are bounded by a certain value, an optimal sequence is V-shaped. © 1997 John Wiley & Sons, Inc. 相似文献
225.
The problem of determining the sample sizes in various strata when several characteristics are under study is formulated as a nonlinear multistage decision problem. Dynamic programming is used to obtain an integer solution to the problem. © 1997 John Wiley & Sons, Inc. 相似文献
226.
A recent paper finds that when volume discounts are available, in some cases, reliance on the Economic Order Quantity (EOQ) model can induce purchasers to make wealth reducing decisions, and the Present Value (PV) approach should be preferred. While this finding is theoretically correct, the magnitudes of wealth reductions suggested by the paper's numerical examples seem to be questionable. Furthermore, the paper also finds that, in some other cases, a purchaser using the EOQ approach realizes a net increase in current wealth compared to a purchaser using the PV approach. Logic suggests that such a finding cannot be correct, since by its very definition, it is the PV approach that seeks to maximize the current wealth. We offer an alternative frame of comparison and a modified model to show that, under the paper's assumptions, the EOQ approach can never realize a net increase in current wealth compared to the current wealth generated by the PV approach. On the other hand, we also show that when typical values of the relevant parameters prevail, the additional costs imposed by the EOQ approach are not significant. Finally, we suggest that insofar as the PV approach requires greater administrative costs to implement, it may even be counterproductive to the goal of wealth maximization. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 377–389, 1998 相似文献
227.
Ronald D. Fricker 《海军后勤学研究》1998,45(1):1-22
This paper revisits the modeling by Bracken [3] of the Ardennes campaign of World War II using the Lanchester equations. It revises and extends that analysis in a number of ways: (1) It more accurately fits the model parameters using linear regression; (2) it considers the data from the entire campaign; and (3) it adds in air sortie data. In contrast to previous results, it concludes by showing that neither the Lanchester linear or Lanchester square laws fit the data. A new form of the Lanchester equations emerges with a physical interpretation. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 1–22, 1998 相似文献
228.
Components in a complex system are usually not structurally identical. However, in many cases we may find components that are structurally symmetric, and one should make use of this additional information to simplify reliability analysis. The main purpose of this article is to define and study one such class of systems, namely, those having symmetric components, and to derive some reliability-related properties. © 1996 John Wiley & Sons, Inc. 相似文献
229.
The compound Poisson “local” formulation of the Stein-Chen method is applied to problems in reliability theory. Bounds for the accuracy of the approximation of the reliability by an appropriate compound Poisson distribution are derived under fairly general conditions, and are applied to consecutive-2 and connected-s systems, and the 2-dimensional consecutive-k-out-ofn system, together with a pipeline model. The approximations are usually better than the Poisson “local” approach would give. © 1996 John Wiley & Sons, Inc. 相似文献
230.
Polling systems are used to model a wide variety of real-world applications, for example, telecommunication and material handling systems. Consequently, there is continued interest in developing efficient algorithms to analyze the performance of polling systems. Recent interest in the optimization of these systems has brought up the need for developing very efficient techniques for analyzing their waiting times. This article presents the Individual Station technique for cyclic polling systems. The technique possesses the following features: (a) it allows the user to compute the mean waiting time at a selected station independent of the mean waiting time computations at other stations, and (b) its complexity is low and independent of the system utilization. In addition the technique provides explicit closed-form expressions for (i) the mean waiting times in a system with 3 stations, and (ii) the second moment of the waiting times in a system with 2 stations, for an exhaustive service system. © 1996 John Wiley & Sons, Inc. 相似文献