全文获取类型
收费全文 | 1352篇 |
免费 | 30篇 |
出版年
2021年 | 18篇 |
2019年 | 39篇 |
2018年 | 22篇 |
2017年 | 35篇 |
2016年 | 30篇 |
2015年 | 32篇 |
2014年 | 25篇 |
2013年 | 266篇 |
2010年 | 15篇 |
2009年 | 17篇 |
2007年 | 17篇 |
2006年 | 17篇 |
2005年 | 22篇 |
2004年 | 25篇 |
2003年 | 14篇 |
2002年 | 16篇 |
2000年 | 18篇 |
1999年 | 14篇 |
1998年 | 21篇 |
1997年 | 28篇 |
1996年 | 26篇 |
1995年 | 11篇 |
1994年 | 29篇 |
1993年 | 20篇 |
1992年 | 18篇 |
1991年 | 30篇 |
1990年 | 18篇 |
1989年 | 30篇 |
1988年 | 24篇 |
1987年 | 28篇 |
1986年 | 31篇 |
1985年 | 26篇 |
1984年 | 19篇 |
1983年 | 20篇 |
1982年 | 18篇 |
1981年 | 18篇 |
1980年 | 20篇 |
1979年 | 22篇 |
1978年 | 21篇 |
1977年 | 17篇 |
1976年 | 21篇 |
1975年 | 15篇 |
1974年 | 23篇 |
1973年 | 23篇 |
1972年 | 21篇 |
1971年 | 22篇 |
1970年 | 16篇 |
1969年 | 16篇 |
1968年 | 14篇 |
1967年 | 14篇 |
排序方式: 共有1382条查询结果,搜索用时 31 毫秒
911.
912.
913.
914.
915.
A service center to which customers bring failed items for repair is considered. The items are exchangeable in the sense that a customer is ready to take in return for the failed item he brought to the center any good item of the same kind. This exchangeability feature makes it possible for the service center to possess spares. The focus of the article is on customer delay in the system—the time that elapses since the arrival of a customer with a failed item and his departure with a good one—when repaired items are given to waiting customers on a FIFO basis. An algorithm is developed for the computation of the delay distribution when the item repair system operates as an M/M/c queue. 相似文献
916.
We discuss a time dependent optimal ordering policy for a finite horizon inventory system for which the provision of service is essential and thus no stockout is allowed. It is assumed that the system can place an order at any point in time during the horizon when it cannot meet the customer's demand and that lead time is negligible. The demand is considered to be distributed as a compound Poisson process with known parameters and the functional equation approach of dynamic programming is used to formulate the objective function. An algorithm has been developed to obtain the solution for all the cases. In addition, analytical solutions of the basic equation under two limiting conditions are presented. 相似文献
917.
Currently, sophisticated multiechelon models compute stockage quantities for spares and repair parts that will minimize total inventory investment while achieving a target level of weapon system operational availability. The maintenance policies to be followed are input to the stockage models. The Optimum Allocation of Test Equipment/Manpower Evaluated Against Logistics (OATMEAL) model will determine optimum maintenance as well as stockage policies for a weapon system. Specifically, it will determine at which echelon each maintenance function should be performed, including an option for component or module throwaway. Test equipment requirements to handle work load at each echelon are simultaneously optimized. Mixed-integer programming (MIP) combined with a Lagrangian approach are used to do the constrained cost minimization, that is, to minimize all costs dependent on maintenance and stockage policies while achieving a target weapons system operational availability. Real-life test cases are included. 相似文献
918.
A model of an M/M/1, bulk queue with service rates dependent on the batch size is developed. The operational policy is to commence service when at least L customers are available with a maximum batch size of K. Arriving customers are not allowed to join in-process service. The solution procedure utilizes the matrix geometric methodology and reduces to obtaining the inverse of a square matrix of dimension K + 1 - L. For the case where the service rates are not batch size dependent, the limiting probabilities can be written in closed form. A numerical example illustrates the variability of the system cost as a function of the minimum batch service size L. 相似文献
919.
920.
Theodor J. Stewart 《海军后勤学研究》1985,32(2):263-274
A search model is formulated in which positive information may be obtained, through the detection of trails, as to the target's earlier whereabouts. The corresponding Bayesian update formulas for target location probabilities are derived. The model does not appear to be amenable to rigorous optimization. A moving-horizon rule, and a heuristic simplification thereof, are, however, derived. In two numerical examples it is demonstrated that actively designing for detecting trail information, through use of these moving-horizon rules, has substantial potential advantage over using, for example, myopic rules even if the positive information is adaptively incorporated into location probabilities before applying the latter rules in each time period. 相似文献