全文获取类型
收费全文 | 3415篇 |
免费 | 82篇 |
国内免费 | 1篇 |
出版年
2021年 | 38篇 |
2019年 | 89篇 |
2018年 | 54篇 |
2017年 | 85篇 |
2016年 | 80篇 |
2015年 | 61篇 |
2014年 | 67篇 |
2013年 | 734篇 |
2010年 | 35篇 |
2009年 | 37篇 |
2008年 | 49篇 |
2007年 | 52篇 |
2006年 | 36篇 |
2005年 | 42篇 |
2004年 | 56篇 |
2003年 | 42篇 |
2002年 | 57篇 |
2001年 | 34篇 |
1999年 | 42篇 |
1998年 | 49篇 |
1997年 | 51篇 |
1996年 | 64篇 |
1995年 | 42篇 |
1994年 | 62篇 |
1993年 | 64篇 |
1992年 | 59篇 |
1991年 | 76篇 |
1990年 | 39篇 |
1989年 | 74篇 |
1988年 | 80篇 |
1987年 | 69篇 |
1986年 | 73篇 |
1985年 | 67篇 |
1984年 | 37篇 |
1983年 | 42篇 |
1982年 | 44篇 |
1981年 | 46篇 |
1980年 | 52篇 |
1979年 | 45篇 |
1978年 | 49篇 |
1977年 | 46篇 |
1976年 | 45篇 |
1975年 | 47篇 |
1974年 | 52篇 |
1973年 | 51篇 |
1972年 | 52篇 |
1971年 | 44篇 |
1970年 | 40篇 |
1969年 | 40篇 |
1968年 | 36篇 |
排序方式: 共有3498条查询结果,搜索用时 15 毫秒
81.
Alan J. Kaplan 《海军后勤学研究》1970,17(2):253-258
This paper is concerned with the optimum decision variables found using order quantity, reorder point (Q, R) inventory models. It examines whether the optimum variables (Q* and R*) are necessarily monotonic functions of the backorder cost parameter (or equivalently of the performance objective). For a general class of models it is proved that R* must increase as the performance objective is raised, and an inequality condition is derived which governs how Q* will change. Probability distributions of lead time demand are cited or found for which Q* increases, Q* decreases, and Q* is independent of increases in performance objectives or backorder cost parameter. 相似文献
82.
Under certain conditions, the re-supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction. 相似文献
83.
This paper presents a general solution for the M/M/r queue with instantaneous jockeying and r > 1 servers. The solution is obtained in matrices in closed form without recourse to the generating function arguments usually used. The solution requires the inversion of two (Zr?1) × (2r?1) matrices. The method proposed is extended to allow different queue selection preferences of arriving customers, balking of arrivals, jockeying preference rules, and queue dependent selection along with jockeying. To illustrate the results, a problem previously published is studied to show how known results are obtained from the proposed general solution. 相似文献
84.
85.
M. E. Nightengale 《海军后勤学研究》1970,17(4):507-514
Frequently there exists an insufficient amount of actual data upon which to base a decision. In this paper a method is presented whereby the subjective opinions of a group of qualified persons are utilized to quantify the relative importance of a finite number of parameters or objectives. A means of testing the consistency among the judges is given which allows the decision maker to determine the validity of the opinions gathered. The application presented here is in the area of Multiple Incentive Contracting. Namely, a method is proposed to facilitate the answering of the question, “What is the value to the purchaser of an incremental change in the performance of a system?” Such a vehicle is not essential to the methodology proposed. 相似文献
86.
In this paper a model is presented which focuses on the difficult problem of predicting demands for items with extremely low usage rates. These form the bulk of repair parts in military systems. The basic notion underlying the model is the pooling of usage data for common design items with movement for the purpose of estimating usage rates for similar items which have shown no movement. A unique feature of the model is that it also makes possible the estimation of usage rates for items newly introduced into a system for which no previous usage history is available. 相似文献
87.
Henry E. Eccles 《海军后勤学研究》1966,13(3):351-353
88.
89.
Industrial situations exist where it is necessary to estimate the optimum number of parts to start through a manufacturing process in order to obtain a given number of completed good items. The solution to this problem is not straightforward when the expected number of rejects from the process is a random variable and when there are alternative penalties associated with producing too many or too few items. This paper discusses various aspects of this problem as well as some of the proposed solutions to it. In addition, tables of optimum reject allowances based on a comprehensive model are presented. 相似文献
90.
Melvin A. Breuer 《海军后勤学研究》1966,13(1):83-95
In this paper a component placement problem and a digital computer backboard wiring problem are formulated as integer linear programs. The component placement problem consists of making a unique assignment of components to column positions such that wireability is maximized. The backboard wiring problem consists of three interrelated subproblems, namely, the placement, the connection, and the routing problems. The placement and connection problems are combined and solved as one, thereby giving the optimal circuit connections as well as minimizing the total lead length. It is shown that under certain assumptions, the number of inequalities and variables in the problem can be greatly reduced. Further simplifying assumptions lead to a near optimal solution. Examples of other allocation problems to which the models presented here are applicable are given. The following concepts are formulated as linear inequalities: (1) the absolute magnitude of the difference between two variables; (2) minimize the minimum function of a set of functions; and (3) counting the number of (0, 1) adjacent component pairs in a vector. 相似文献