首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   446篇
  免费   9篇
  2021年   11篇
  2019年   11篇
  2017年   12篇
  2016年   10篇
  2015年   12篇
  2014年   9篇
  2013年   81篇
  2011年   3篇
  2010年   4篇
  2008年   4篇
  2007年   5篇
  2006年   6篇
  2005年   5篇
  2004年   4篇
  2003年   3篇
  2002年   9篇
  2001年   6篇
  2000年   5篇
  1999年   4篇
  1998年   10篇
  1997年   8篇
  1996年   5篇
  1995年   6篇
  1994年   8篇
  1993年   9篇
  1992年   7篇
  1991年   10篇
  1989年   9篇
  1988年   16篇
  1987年   6篇
  1986年   15篇
  1985年   12篇
  1984年   7篇
  1983年   6篇
  1982年   4篇
  1981年   9篇
  1980年   7篇
  1979年   11篇
  1978年   7篇
  1977年   7篇
  1976年   3篇
  1975年   11篇
  1974年   9篇
  1973年   6篇
  1972年   7篇
  1971年   7篇
  1970年   4篇
  1969年   7篇
  1968年   4篇
  1966年   3篇
排序方式: 共有455条查询结果,搜索用时 15 毫秒
191.
The problem of determining the optimal inspection epoch is studied for reliability systems in which N components operate in parallel. Lifetime distribution is arbitrary, but known. The optimization is carried with respect to two cost factors: the cost of inspecting a component and the cost of failure. The inspection epochs are determined so that the expected cost of the whole system per time unit per cycle will be minimized. The optimization process depends in the general case on the whole failure history of the system. This dependence is characterized. The cases of Weibull lifetime distributions are elaborated and illustrated numerically. The characteristics of the optimal inspection intervals are studied theoretically.  相似文献   
192.
In this paper we consider a multiperiod deterministic capacity expansion and shipment planning problem for a single product. The product can be manufactured in several producing regions and is required in a number of markets. The demands for each of the markets are non-decreasing over time and must be met exactly during each time period (i.e., no backlogging or inventorying for future periods is permitted). Each region is assumed to have an initial production capacity, which may be increased at a given cost in any period. The demand in a market can be satisfied by production and shipment from any of the regions. The problem is to find a schedule of capacity expansions for the regions and a schedule of shipments from the regions to the markets so as to minimize the discounted capacity expansion and shipment costs. The problem is formulated as a linear programming model, and solved by an efficient algorithm using the operator theory of parametric programming for the transporation problem. Extensions to the infinite horizon case are also provided.  相似文献   
193.
The minimum-cost formulation of the problem of determining multicommodity flows over a capacitated network subject to resource constraints has been treated in previobs papers. In those treatments only capacitated arcs were assumed and a uniform unit of measure like short tons was used for all commodities. This paper treats the effect of constraints on the nodes of the network, allows the commodities to be measured in their “natural” units and allows the network capacities to be expressed in vehicles per time period-in some cases giving a more accurate representation of the capacities of the network. This paper describes the solution procedure which uses the column generation technique; it also discusses computational experience.  相似文献   
194.
A flow shop sequencing problem with ordered processing time matrices is considered. A convex property for the makespan sequences of such problems is discussed. On the basis of this property an efficient optimizing algorithm is presented. Although the proof of optimality has not been developed, several hundred problems were solved optimally with this procedure.  相似文献   
195.
Adaptive forecasting procedures are developed for predicting the size of a work force which is subject to random withdrawals. The procedures are illustrated using Marine Corps data in which four stages of service for incoming cohorts are distinguished. Using these data, three forecasting procedures—conditional maximum likelihood estimation of prediction intervals; tolerance intervals; and Bayes prediction intervals—are compared.  相似文献   
196.
In this note the authors call for a change of the optimality criteria given by Theorem 3 in section 5 of the paper of W. Szwarc “On Some Sequencing Problems” in NRLQ Vol. 15, No. 2 [2]. Further, two cases of the three machine problem, namely, (i) ≦ and (ii) ≦ are considered, and procedures for obtaining optimal sequences in these cases are given. In these cases the three-machine problem is solved by solving n (the number of jobs) two-machine problems.  相似文献   
197.
The most vital link in a single commodity flow network is that are whose removal results in the greatest reduction in the value of the maximal flow in the network between a source node and a sink node. This paper develops an iterative labeling algorithm to determine the most vital link in the network. A necessary condition for an are to be the most vital link is established and is employed to decrease the number of ares which must be considered.  相似文献   
198.
We consider the problem of scheduling n jobs with random processing times on a single machine in order to minimize the expected variance of the completion times. We prove a number of results, including one to the effect that the optimal schedule must be V shaped when the jobs have identical means or variances or have exponential processing times.  相似文献   
199.
In this paper we examine the one- and two-sided sampling plans for the exponential distribution. Solutions are provided for several situations arising out of the assumptions on the knowledge of the parameters of the distribution. The values of the constants are tabled in the special case of p1 = p2 for the two-sided plans.  相似文献   
200.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号