全文获取类型
收费全文 | 3585篇 |
免费 | 87篇 |
国内免费 | 1篇 |
专业分类
3673篇 |
出版年
2021年 | 38篇 |
2019年 | 92篇 |
2018年 | 57篇 |
2017年 | 81篇 |
2016年 | 82篇 |
2015年 | 70篇 |
2014年 | 73篇 |
2013年 | 764篇 |
2012年 | 46篇 |
2011年 | 56篇 |
2010年 | 57篇 |
2009年 | 50篇 |
2008年 | 71篇 |
2007年 | 60篇 |
2006年 | 46篇 |
2005年 | 47篇 |
2004年 | 56篇 |
2003年 | 45篇 |
2002年 | 59篇 |
1999年 | 42篇 |
1998年 | 47篇 |
1997年 | 51篇 |
1996年 | 63篇 |
1995年 | 43篇 |
1994年 | 62篇 |
1993年 | 64篇 |
1992年 | 59篇 |
1991年 | 74篇 |
1990年 | 40篇 |
1989年 | 73篇 |
1988年 | 80篇 |
1987年 | 70篇 |
1986年 | 71篇 |
1985年 | 64篇 |
1984年 | 37篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 47篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 46篇 |
1975年 | 47篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 41篇 |
1969年 | 40篇 |
排序方式: 共有3673条查询结果,搜索用时 15 毫秒
191.
Nicholas G. Hall 《海军后勤学研究》1989,36(4):399-418
We study the problem of finding the minimum number of identical storage areas required to hold n items for which demand is known and constant. The replenishments of the items within a single storage area may be time phased so as to minimize the maximum total storage capacity required at any time. This is the inventory-packing problem, which can be considered as a variant of the well-known bin-packing problem, where one constraint is nonlinear. We study the worst-case performance of six heuristics used for that earlier problem since the recognition version of the inventory-packing problem is shown to be NP complete. In addition, we describe several new heuristics developed specifically for the inventory-packing problem, and also study their worst-case performance. Any heuristic which only opens a bin when an item will not fit in any (respectively, the last) open bin needs, asymptotically, no more than 25/12 (resp., 9/4) times the optimal number of bins. Improved performance bounds are obtainable if the range from which item sizes are taken is known to be restricted. Extensive computational testing indicates that the solutions delivered by these heuristics are, for most problems, very close to optimal in value. 相似文献
192.
A survey of the research done on preventive maintenance is presented. The scope of the present survey is on the research published after the 1976 paper by Pierskalla and Voelker [98]. This article includes optimization models for repair, replacement, and inspection of systems subject to stochastic deterioration. A classification scheme is used that categorizes recent research into inspection models, minimal repair models, shock models, or miscellaneous replacement models. 相似文献
193.
194.
王立群 《军械工程学院学报》1990,(2)
本文论述建立维修科学理论体系的意义和研究时应考虑的一些准则,并提出具体的体系结构模式。该体系由维修导论、维修技术、装备采办和维修管理4个学科分支组成。 相似文献
195.
196.
197.
198.
S. Selcuk Erenguc 《海军后勤学研究》1988,35(1):1-22
In this article we consider a multiproduct dynamic lot-sizing model. In addition to a separate setup cost for each product ordered, a joint setup cost is incurred when at least one product is ordered. We formulate the model as a concave minimization problem over a compact polyhedral set and present a finite branch and bound algorithm for finding an optimal ordering schedule. Superiority of the branch and bound algorithm to the existing exact procedures is demonstrated. We report computational experience with problems whose dimensions render the existing procedures computationally infeasible. 相似文献
199.
An approximation for analyzing transient and nonstationary two-priority non-preemptive queueing systems is presented. This system has a three-dimensional state space, and through use of state-space partitioning in conjunction with use of conditional surrogate distributions with constant parameters an approximation is designed. Regardless of system capacity K, the approximation requires the numerical solution of only ten differential equations, compared to the K2 + K+1 Kolmogorov-forward equations required for the classic solution. Time-dependent approximations of the mean number of entities of type i and of the probability of a type-i entity being in service are obtained. Empirical test results over a wide range of systems indicate the approximation is quite accurate. 相似文献
200.
A machine-replacement problem is analyzed in a technological-development environment, in which a new-type machine (built by a new technology) may appear in the future. The solution of the replacement problem depends on purchasing, operating, and resale costs, and on the probability distribution of the market debut of the new technology, and it indicates whether to replace the existing machine now with an available similar type of machine, or to continue to operate the existing machine for at least one more period. A dynamic discounted cost model is presented, and a method is suggested for finding the optimal age for replacement of an existing machine (under rather general conditions of a technological environment). A solution procedure and a numerical example are given. 相似文献