全文获取类型
收费全文 | 134篇 |
免费 | 2篇 |
出版年
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 5篇 |
2015年 | 2篇 |
2014年 | 4篇 |
2013年 | 50篇 |
2011年 | 1篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2008年 | 3篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2001年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1973年 | 2篇 |
1972年 | 4篇 |
1971年 | 1篇 |
1970年 | 3篇 |
1969年 | 2篇 |
1967年 | 3篇 |
1966年 | 3篇 |
排序方式: 共有136条查询结果,搜索用时 31 毫秒
81.
82.
Richard Barno 《African Security Review》2013,22(4):171-177
83.
84.
85.
86.
87.
Richard C. Grinold 《海军后勤学研究》1972,19(1):123-136
Large complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can be scheduled in several different ways. We assume that a known amount of cash changes hands at each event. Given any schedule the present value of all cash transactions can be calculated. The payment scheduling problem looks for a schedule that maximizes the present value of all transactions. This problem was first introduced by Russell [2]; it is a nonlinear program with linear constraints and a nonconcave objective. This paper demonstrates that the payment scheduling problem can be transformed into an equivalent linear program. The linear program has the structure of a weighted distribution problem and an efficient procedure is presented for its solution. The algorithm requires the solution of triangular systems of equations with all matrix coefficients equal to ± or 0. 相似文献
88.
Consider an inventory system consisting of two installations, the stocking point and the field. Each period two decisions must be made: how much to order from outside the system and how much to ship to the field. The first decision is made based on the total amounts of stock then at the two installations. Next a forecast of the demand in the current period is sent from the field to the stocking point. Based upon a knowledge of the joint distribution of the forecast and the true demand, and the amounts of stock at the two installations, a decision to ship a certain amount of stock to the field is taken. The goal is to make these two decisions so as to minimize the total n-period cost for the system. Following the factorization idea of Clark and Scarf (1960), the optimal n period ordering and shipping policy, taking into account the accuracy of the demand forecasts, can be derived so as to make the calculation comparable to those required by two single installations. 相似文献
89.
Richard C. Morey 《海军后勤学研究》1975,22(3):455-460
This paper develops and illustrates an approximate approach for analytically assessing the impacts on both costs and service of consolidation of repair facilities. The repair facilities are two echelon generalizations of the classical repairmen problem in which two types of failures, say major and minor, can occur, each type requiring repair at a different echelon: The questions addressed are the reductions possible in spares, repairmen, and service rates due to the consolidated system's increased efficiency, as well as the physical separation between the users and the consolidated repair facility that is economical. The method of analysis is based upon asymptotic approximations developed for the repairmen problem, valid when the number of operational equipments is large (greater than 50); it is helpful since it provides a tractable means for predicting the steady-state performance of the decentralized and consolidated installations as a function of the many parameters involved without having to resort to an exhaustive computation of all the exact steady-state probabilities. 相似文献
90.
This paper is concerned with the determination of explicit expressions for economic order quantities and reorder levels, such that the cost of ordering and holding inventory is minimized for specific backorder constraints. Holding costs are applied either to inventory position or on-hand inventory, and the backorder constraint is considered in terms of the total number of backorders per year or the average number of backorders at any point in time. Through the substitution of a new probability density function in place of the normal p.d.f., explicit expressions are determined for the economic order quantities and the reorder points. The resulting economic order quantities are independent of all backorder constraints. It is also concluded that under certain conditions, the minimization of ordering costs and inventory holding costs (applied to inventory position), subject to a backorder constraint, is equivalent in terms of reorder levels to minimization of the safety level dollar investment subject to the same backorder constraint. 相似文献