全文获取类型
收费全文 | 216篇 |
免费 | 2篇 |
专业分类
218篇 |
出版年
2018年 | 7篇 |
2017年 | 4篇 |
2016年 | 8篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 82篇 |
2012年 | 2篇 |
2011年 | 1篇 |
2010年 | 3篇 |
2009年 | 1篇 |
2008年 | 1篇 |
2006年 | 1篇 |
2005年 | 6篇 |
2004年 | 1篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 6篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 6篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1972年 | 3篇 |
1971年 | 3篇 |
1970年 | 2篇 |
1969年 | 3篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有218条查询结果,搜索用时 15 毫秒
141.
142.
143.
A U‐line arranges tasks around a U‐shaped production line and organizes them into stations that can cross from one side of the line to the other. In addition to improving visibility and communication between operators on the line, which facilitates problem‐solving and quality improvement, U‐lines can reduce the total number of operators required on the line and make rebalancing the line easier compared to the traditional, straight production line. This paper studies the (type 1) U‐line balancing problem when task completion times are stochastic. Stochastic completion times occur when differences between operators cause completion times to vary somewhat and when machine processing times vary. A recursive algorithm is presented for finding the optimal solution when completion times have any distribution function. An equivalent shortest path network is also presented. An improvement for the special case of normally distributed task completion times is given. A computational study to determine the characteristics of instances that can be solved by the algorithms shows that they are able to solve instances of practical size (like the 114 Japanese and U.S. U‐lines studied in a literature review paper). © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
144.
Henrich John Malik 《海军后勤学研究》1970,17(3):327-330
In this paper the exact distribution of the product of two noncentral beta variates is derived using Mellin integral transform. The density function of the product is represented as a mixture of Beta distributions and the distribution function as a mixture of Incomplete Beta Functions. 相似文献
145.
146.
A cutting plane method, based on a geometric inequality, is described as a means of solving geometric programs. While the method is applied to the primal geometric program, it is shown to retain the geometric programming duality relationships. Several methods of generating the cutting planes are discussed and illustrated on some example problems. 相似文献
147.
John P. Bonin 《海军后勤学研究》1978,25(2):357-364
In a static environment, J. Hirschleifer's marginal cost solution to the transfer pricing problem is commonly accepted as analytically correct. However, actual pricing practice within Western corporations and socialist-planned economies generally deviates from marginal cost pricing. Some form of average cost pricing is more commonly chosen. Recently in this journal, H. Enzer has claimed to show that some form of average cost pricing is indeed the analytically correct solution to the transfer pricing problem when choice of technique and manipulation are allowed. Enzer claims that optimal decisions made by each of two divisions according to their individual self-interests are made compatible with overall firm optimization when the transfer price assigned to the internally-transferred commodity is any form of average cost. We show that the marginal cost solution is correct for Enzer's problem in the absence of manipulation by either division. Indeed, this was all that Hirschleifer claimed. In the process, we uncover a fundamental mathematical error in Enzer's argument. When manipulation of the transfer price by divisions is allowed, we demonstrate the faults with Enzer's average cost solution and conclude Hirschleifer's original statements on manipulation to be correct even in Enzer's environment. A final section briefly indicates the importance to the transfer pricing problem of a growing body of economic literature on incentive structures. 相似文献
148.
The 0-1 multiple-knapsack problem is an extension of the well-known 0-1 knapsack problem. It is a problem of assigning m objects, each having a value and a weight, to n knapsacks in such a way that the total weight in each knapsack is less than its capacity limit and the total value in the knapsacks is maximized. A branch-and-bound algorithm for solving the problem is developed and tested. Branching rules that avoid the search of redundant partial solutions are used in the algorithm. Various bounding techniques, including Lagrangean and surrogate relaxations, are investigated and compared. 相似文献
149.
We consider the problem of minimizing the sum of production, employment smoothing, and inventory costs over a finite number of time periods where demands are known. The fundamental difference between our model and that treated in [1] is that here we permit the smoothing cost to be nonstationary, thereby admitting a model with discounting. We show that the values of the instrumental variables are nondecreasing in time when demands are nondecreasing. We also derive some asymptotic properties of optimal policies. 相似文献
150.