全文获取类型
收费全文 | 410篇 |
免费 | 8篇 |
出版年
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 10篇 |
2018年 | 8篇 |
2017年 | 13篇 |
2016年 | 12篇 |
2015年 | 7篇 |
2014年 | 11篇 |
2013年 | 68篇 |
2012年 | 3篇 |
2011年 | 6篇 |
2010年 | 8篇 |
2009年 | 9篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2006年 | 6篇 |
2005年 | 6篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 11篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 6篇 |
1997年 | 12篇 |
1996年 | 7篇 |
1995年 | 9篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 15篇 |
1987年 | 5篇 |
1986年 | 11篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 8篇 |
1972年 | 2篇 |
1971年 | 7篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1967年 | 3篇 |
排序方式: 共有418条查询结果,搜索用时 15 毫秒
21.
22.
23.
24.
25.
Roger C. Schroeder 《海军后勤学研究》1974,21(3):375-388
Most inventory formulations seek to minimize the sum of ordering costs, holding costs, and stockout costs: however, management often directs inventory policy by specifying a maximum investment level and/or a purchasing budget constraint. Within these limitations, they expect lower level managers to optimize some level of customer satisfaction, such as minimum stockouts or minimum shortages. The author has developed several cases of these “managerial” inventory formulations and has presented some computational results. 相似文献
26.
In many location problems, the solution is constrained to lie within a closed set. In this paper, optimal solutions to a special type of constrained location problem are characterized. In particular, the location problem with the solution constrained to be within a maximum distance of each demand point is considered, and an algorithm for its solution is developed and discussed. 相似文献
27.
Let X1 < X2 <… < Xn denote an ordered sample of size n from a Weibull population with cdf F(x) = 1 - exp (?xp), x > 0. Formulae for computing Cov (Xi, Xj) are well known, but they are difficult to use in practice. A simple approximation to Cov(Xi, Xj) is presented here, and its accuracy is discussed. 相似文献
28.
A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study. 相似文献
29.
This paper considers the problem of computing optimal ordering policies for a product that has a life of exactly two periods when demand is random. Initially costs are charged against runouts (stockouts) and outdating (perishing). By charging outdating costs according to the expected amount of outdating one period into the future, a feasible one period model is constructed. The central theorem deals with the n-stage dynamic problem and demonstrates the appropriate cost functions are convex in the decision variable and also provides bounds on certain derivatives. The model is then generalized to include ordering and holding costs. The paper is concluded with a discussion of the infinite horizon problem. 相似文献
30.