全文获取类型
收费全文 | 441篇 |
免费 | 10篇 |
出版年
2023年 | 2篇 |
2020年 | 5篇 |
2019年 | 18篇 |
2018年 | 11篇 |
2017年 | 12篇 |
2016年 | 17篇 |
2015年 | 13篇 |
2014年 | 16篇 |
2013年 | 121篇 |
2012年 | 4篇 |
2011年 | 13篇 |
2010年 | 7篇 |
2009年 | 8篇 |
2008年 | 8篇 |
2007年 | 9篇 |
2006年 | 5篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 7篇 |
1998年 | 5篇 |
1997年 | 6篇 |
1996年 | 6篇 |
1995年 | 8篇 |
1994年 | 10篇 |
1993年 | 7篇 |
1992年 | 10篇 |
1991年 | 8篇 |
1990年 | 6篇 |
1989年 | 10篇 |
1988年 | 9篇 |
1987年 | 7篇 |
1986年 | 6篇 |
1985年 | 6篇 |
1983年 | 3篇 |
1981年 | 2篇 |
1979年 | 3篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 3篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1970年 | 3篇 |
1968年 | 3篇 |
1967年 | 2篇 |
1966年 | 1篇 |
排序方式: 共有451条查询结果,搜索用时 31 毫秒
171.
In the study of complex queueing systems, analysis techniques aimed al providing exact solutions become ineffective. Approximation techniques provide an attractive alternative in such cases. This paper gives an overview of different types of approximation techniques available in the literature and points out their relative merits. Also, the need for proper validation procedures of approximation techniques is emphasized. 相似文献
172.
Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally yields better solutions than those obtained by application of the heuristics, and b) sensitivity analysis with different values of cycle time is possible without having to regenerate the network. The rationale for its effectiveness and its application to problems with paralleling are presented. Computational experience with the procedure on up to 50 task test problems is provided. 相似文献
173.
David R. Denzler 《海军后勤学研究》1969,16(3):411-416
This paper describes an approximate solution method for solving the fixed charge problem. This heuristic approach is applied to a set of test problems to explore the margin of error. The results indicate that the proposed fixed charge simplex algorithm is capable of finding optimal or near optimal solutions to moderate sized fixed charge problems. In the absence of an exact method, this heuristic should prove useful in solving this fundamental nonlinear programming problem. 相似文献
174.
175.
176.
177.
178.
A deterministic inventory model for reparable items 总被引:1,自引:0,他引:1
David A. Schrady 《海军后勤学研究》1967,14(3):391-398
A reparable inventory system has two distinct inventories within it—the inventory of items ready-for-issue and the inventory of carcasses available for repair. A reparable item is usually rebuilt upon failure, but the scrap rate in the repair process is generally positive. Consequently, new items must be procured from time to time to replace those item: which were scrapped. The ready-for-issue inventory has two input sources—procurement and repair, This paper develops a deterministic inbentory model for the reparable inventory system, and determines the optimal procurement and repair quantities. 相似文献
179.
Martin Samuels 《Defense & Security Analysis》1990,6(2):215-219
If Germany Attacks: the Battle in Depth in the West. By Captain Graeme C. Wynne. Faber & Faber, London (1940) [reprinted by Greenwood Press, Westport, CT (1976)] 相似文献
180.