全文获取类型
收费全文 | 816篇 |
免费 | 19篇 |
出版年
2021年 | 18篇 |
2019年 | 28篇 |
2018年 | 12篇 |
2017年 | 18篇 |
2016年 | 17篇 |
2015年 | 21篇 |
2014年 | 16篇 |
2013年 | 157篇 |
2008年 | 9篇 |
2007年 | 9篇 |
2006年 | 9篇 |
2005年 | 11篇 |
2004年 | 9篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2001年 | 10篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 16篇 |
1997年 | 21篇 |
1996年 | 12篇 |
1995年 | 9篇 |
1994年 | 16篇 |
1993年 | 9篇 |
1992年 | 11篇 |
1991年 | 20篇 |
1989年 | 14篇 |
1988年 | 20篇 |
1987年 | 19篇 |
1986年 | 23篇 |
1985年 | 15篇 |
1984年 | 11篇 |
1983年 | 12篇 |
1982年 | 12篇 |
1981年 | 11篇 |
1980年 | 12篇 |
1979年 | 21篇 |
1978年 | 14篇 |
1977年 | 15篇 |
1976年 | 8篇 |
1975年 | 15篇 |
1974年 | 13篇 |
1973年 | 15篇 |
1972年 | 13篇 |
1971年 | 9篇 |
1970年 | 10篇 |
1969年 | 11篇 |
1968年 | 7篇 |
1967年 | 7篇 |
1966年 | 6篇 |
排序方式: 共有835条查询结果,搜索用时 0 毫秒
741.
Everette S. Gardner 《海军后勤学研究》1983,30(1):59-68
Constrained multi-item inventory models have long presented signifcant computational problems. This article presents a general algorithm to obtain simultaneous solutions for order quantities and safety stocks for each line item in an inventory, while satisfying constraints on average inventory investment and reordering workload. Computational experience is presented that demonstrates the algorithm's efficiency in handling large-scale applications. Decision rules for several customer service objectives are developed, with a discussion of the characteristics of the inventory systems in which each objective would be most appropriate. The decision rules are approximations, based on the assumptions commonly used in practice. 相似文献
742.
This article proposes a practical, data-based statistical procedure which can be used to reduce or remove bias owing to artificial startup conditions in simulations aimed at estimating steady-state means. We discuss results of experiments designed to choose good parameter values for this procedure, and present results of extensive testing of the procedure on a variety of stochastic models for which partial analytical results are available. The article closes with two illustrations of the application of the procedure to more complex statistical problems which are more representative of the kinds of purposes for which real-world steady-state simulation studies might be undertaken. 相似文献
743.
This article examines a version of the machine repair problem where failures may be irreparable. Since the number of machines in the system keeps decreasing, we impose a fixed state-dependent ordering policy of the type often encountered in inventory models. Although the system is Markovian, the number of states becomes very large. The emphasis of the article, therefore, is on deriving computationally tractable formulas for the steady-state probabilities, the long-run average cost per unit time, and the vector of expected discounted costs. When the state space is so large that exact computations may be infeasible, we propose approximations which are relatively quick and simple to compute and which yield very accurate results for the test problems examined. 相似文献
744.
James A. M. McHugh 《海军后勤学研究》1984,31(3):409-411
This article presents a simple proof of Hu's algorithm for scheduling in minimum time a set of tasks constrained by precedence tree constraints, each task requiring a unit time to complete, and where m processors are available. 相似文献
745.
Mokhtar S. Bazaraa 《海军后勤学研究》1975,22(2):399-404
In this study, a simple and efficient cyclic coordinate search procedure is used to optimize penalty functions. Since the contours of the penalty function are very ill-behaved, an accurate line search is very difficult to achieve. Due to accumulated errors in line search, this makes “simple-minded” search directions just as good as more sophisticated directions, and actually better since they require a smaller effort per iteration. Of course this is only true if the search procedure is able to “ride” along steep ridges, and meanwhile move an appreciable distance towards the optimal, if at all possible. Computational results on the cyclic coordinate method seems to support this point of view, and shows robustness, reliability, and efficiency of the method. 相似文献
746.
To solve linear fixed charge problems with Murty's vertex ranking algorithm, one uses a simplex algorithm and a procedure to determine the vertices adjacent to a given vertex. In solving fixed charge transportation problems, the simplex algorithm simplifies to the stepping-stone algorithm. To find adjacent vertices on transportation polytopes, we present a procedure which is a simplification of a more general procedure for arbitrary polytopes. 相似文献
747.
S. S. Chitgopekar 《海军后勤学研究》1975,22(3):567-573
We consider a denumerable state Markovian sequential control process. It is well known that when we consider the expected total discounted income as a criterion, there exists a nonrandomized stationary policy that is optimal. It is also well known that when we consider the expected average income as a criterion, an optimal nonrandomized stationary policy exists when a certain system of equations has a solution. The problem considered here is: if there exist two optimal nonrandomized stationary policies, will a randomization of these two policies be optimal? It is shown that in the discounted case the answer is always yes, but in the average income case, the answer is yes only under certain additional conditions. 相似文献
748.
Tuncel M. Yegulalp 《海军后勤学研究》1975,22(4):697-712
This paper introduces a special control chart procedure for exponentially distributed product life. Statistical control of product life in manufacturing requires continuing life tests of manufactured product so as to detect changes in product life and take appropriate corrective action. These life testing experiments may become exceedingly time consuming and thus can be both impractical because of serious time delays in implementing corrective action on the process when indicated, and quite uneconomical. It is desirable to inquire into the character of life testing by means of a control chart procedure based on the real time to first failure within given samples. Measuring the real minimum life provides a considerable reduction in duration of the testing procedure and in the number of specimens destroyed, yielding a considerable economy over the Shewhart's X control chart. 相似文献
749.
Detailed combat simulations can produce effectiveness tables which measure the effectiveness of each weapon class on one side of an engagement, battle, or campaign to each weapon class on the other. Effectiveness tables may also be constructed in other ways This paper assumes that effectiveness tables are given and shows how to construct from them a system of weapon weights each of which is a weighted average of the effects of a given weapon against each of the enemy's weapons. These weights utilize the Perron- Frobenius theory of eigenvectors of nonnegative matrices. Methods of calculation are discussed and some interpretations are given for both the irreducible and reducible cases. 相似文献
750.