全文获取类型
收费全文 | 619篇 |
免费 | 51篇 |
国内免费 | 4篇 |
出版年
2021年 | 9篇 |
2020年 | 9篇 |
2019年 | 24篇 |
2018年 | 17篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 12篇 |
2014年 | 16篇 |
2013年 | 120篇 |
2011年 | 12篇 |
2010年 | 13篇 |
2009年 | 10篇 |
2008年 | 17篇 |
2007年 | 14篇 |
2006年 | 8篇 |
2005年 | 12篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 9篇 |
2000年 | 8篇 |
1999年 | 13篇 |
1998年 | 10篇 |
1997年 | 13篇 |
1996年 | 15篇 |
1995年 | 13篇 |
1994年 | 16篇 |
1993年 | 9篇 |
1992年 | 10篇 |
1991年 | 14篇 |
1990年 | 13篇 |
1989年 | 13篇 |
1988年 | 12篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 9篇 |
1984年 | 7篇 |
1983年 | 6篇 |
1981年 | 6篇 |
1980年 | 10篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1976年 | 6篇 |
1975年 | 8篇 |
1972年 | 7篇 |
1971年 | 10篇 |
1970年 | 7篇 |
1968年 | 7篇 |
1967年 | 5篇 |
1966年 | 7篇 |
排序方式: 共有674条查询结果,搜索用时 15 毫秒
161.
162.
K. D. Glazebrook 《海军后勤学研究》1984,31(2):251-264
A single machine is available to process a collection of stochastic jobs. There may be technological constraints on the job set. The machine sometimes breaks down. Costs are incurred and rewards are earned during processing. We seek strategies for processing the jobs which maximize the total expected reward earned. 相似文献
163.
David Rosenberg 《海军后勤学研究》1979,26(2):349-353
We reformulate the cost equation for the lot-size model with partial back-logging. The formulation is in terms of “fictitious demand rate,” a new inventory decision variable that simplifies the analysis. Using decomposition by projection, we obtain an optimal solution in a straightforward manner. The form of the solution sheds additional light on the behavior of the model. Some of these insights are elucidated by numerical examples. 相似文献
164.
D. Siegmund 《海军后勤学研究》1979,26(1):57-67
One-sided sequential tests for the mean of an exponential distribution are proposed, and the related confidence intervals are computed. The tests behave like the classical sequential probability-ration test when the mean is small and like a fixed-time test when the mean is large and accurate estimation is important. 相似文献
165.
A Markovian model is presented for the development of an optimal repair-replacement policy for the situation requiring a decision only at failure. The problem is characterized by the presence of growth which is integrated into the formulation. The model is applied to an actual problem, with data analysis and results given. Substantial savings are indicated. 相似文献
166.
Hanif D. Sherali 《海军后勤学研究》1981,28(3):447-462
In this paper we consider dual angular and angular structured mixed integer programs which arise in some practical applications. For these problems we describe efficient methods for generating a desirable set of Benders' cuts with which one may initialize the partitioning scheme of Benders. Our research is motivated by the computational experience of McDaniel and Devine who have shown that the set of Benders' cuts which are binding at the optimum to the linear relaxation of the mixed integer program, play an important role in determining an optimal mixed integer solution. As incidental results in our development, we provide some useful remarks regarding Benders' and Dantzig-Wolfe's decomposition procedures. The computational experience reported seems to support the expedients recommended in this paper. 相似文献
167.
This paper is concerned with the statistical test plans contained in Military Standard 781C, “Reliability Design Qualification and Production Acceptance Tests: Exponential Distribution” and the selection and use of these plans. Modifications to the fixed-length test plans of MIL-STD-781C are presented which allow early-accept decisions to be made without sacrificing statistical validity. The proposed plans differ from the probability ratio sequential tests in the Standard in that rejection is permitted only after a fixed number of failures have been observed. 相似文献
168.
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. 相似文献
169.
170.