首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   523篇
  免费   0篇
  523篇
  2021年   7篇
  2019年   9篇
  2018年   5篇
  2017年   5篇
  2016年   10篇
  2015年   3篇
  2014年   5篇
  2013年   87篇
  2012年   4篇
  2009年   6篇
  2007年   15篇
  2005年   3篇
  2004年   4篇
  2003年   8篇
  2002年   11篇
  2000年   3篇
  1999年   6篇
  1998年   8篇
  1997年   8篇
  1996年   12篇
  1995年   6篇
  1994年   9篇
  1993年   13篇
  1992年   10篇
  1991年   14篇
  1990年   11篇
  1989年   20篇
  1988年   18篇
  1987年   13篇
  1986年   16篇
  1985年   9篇
  1984年   6篇
  1983年   4篇
  1982年   12篇
  1981年   8篇
  1980年   11篇
  1979年   10篇
  1978年   13篇
  1977年   5篇
  1976年   6篇
  1975年   6篇
  1974年   10篇
  1973年   11篇
  1972年   4篇
  1971年   11篇
  1970年   8篇
  1969年   6篇
  1967年   10篇
  1966年   5篇
  1948年   4篇
排序方式: 共有523条查询结果,搜索用时 0 毫秒
321.
The bottleneck transportation problem can be stated as follows: A set of supplies and a set of demands are specified such that the total supply is equal to the total demand. There is a transportation time associated between each supply point and each demand point. It is required to find a feasible distribution (of the supplies) which minimizes the maximum transportaton time associated between a supply point and a demand point such that the distribution between the two points is positive. In addition, one may wish to find from among all optimal solutions to the bottleneck transportation problem, a solution which minimizes the total distribution that requires the maximum time Two algorithms are given for solving the above problems. One of them is a primal approach in the sense that improving fcasible solutions are obtained at each iteration. The other is a “threshold” algorithm which is found to be far superior computationally.  相似文献   
322.
This paper explores the relationship between research project cost and expected time to completion under various scheduling strategies; it assumes that many potential technical approaches to the research problem can be identified; and that each approach has a low but finite subjective probability of success. It is shown that under a variety of assumptions, expected time to project completion can be reduced, but that as a result expected project cost rises at an increasing rate. Some cases in which this convex time-cost tradeoff relationship might not hold generally are identified. When the time-cost tradeoff function is convex, the desirability of concurrent as opposed to series scheduling of approaches depends crucially upon the depth of the stream of benefits expected to be realized upon successful project completion. The deeper the benefit stream is, the more desirable concurrent scheduling is.  相似文献   
323.
A general multiperiod multi-echelon supply system consisting of n facilities each stocking a single product is studied. At the beginning of a period each facility may order stock from an exogenous source with no delivery lag and proportional ordering costs. During the period the (random) demands at the facilities are satisfied according to a given supply policy that determines to what extent stock may be redistributed from facilities with excess stock to those experiencing shortages. There are storage, shortage, and transportation costs. An ordering policy that minimizes expected costs is sought. If the initial stock is sufficiently small and certain other conditions are fulfilled, it is optimal to order up to a certain base stock level at each facility. The special supply policy in which each facility except facility 1 passes its shortages on to a given lower numbered facility called its direct supplier is examined in some detail. Bounds on the base stock levels are obtained. It is also shown that if the demand distribution at facility j is stochastically smaller (“spread” less) than that at another facility k having the same direct supplier and if certain other conditions are fulfilled, then the optimal base stock level (“virtual” stock out probability) at j is less than (greater than) or equal to that at facility k.  相似文献   
324.
325.
A “circulating system” is a finite collection of objects, each of which is oscillaling between two states. The prototype system is that of ships on patrcl,each subject to a quasi-regular “duty-service” cycle. There are various restrictions on the time spent in either state by an object and on the number of objects in a state at any one time. Schedules are sought in which the total number in one state is as large and as constant as possible. The maximal average number in one state is calculated, and a necessary and sufficient condition is given for a schedule to achieve it. Procedures are developed for constructing a schedule which achieves the maximal average in the most constant manner.  相似文献   
326.
The segregated storage problem involves the optimal distribution of products among compartments with the restriction that only one product may be stored in each compartment. The storage capacity of each compartment, the storage demand for each product, and the linear cost of storing one unit of a product in a given compartment are specified. The problem is reformulated as a large set-packing problem, and a column generation scheme is devised to solve the associated linear programming problem. In case of fractional solutions, a branch and bound procedure is utilized. Computational results are presented.  相似文献   
327.
This paper studies the one-period, general network distribution problem with linear costs. The approach is to decompose the problem into a transportation problem that represents a stocking decision, and into decoupled newsboy problems that represent the realization of demand with the usual associated holding and shortage costs. This approach leads to a characterization of optimal policies in terms of the dual of the transportation problem. This method is not directly suitable for the solution for large problems, but the exact solution for small problems can be obtained. For the numerical solutions of large problems, the problem has been formulated as a linear program with column generation. This latter approach is quite robust in the sense that it is easily extended to incorporate capacity constraints and the multiproduct case.  相似文献   
328.
This paper reviews a wide variety of manpower and personnel models of the goal programming variety. This is done from a strategy-oriented point of view addressing the problems of interest for immediate implementation as well as basic problems of manpower model research development. Particular emphasis in this paper is concerned with how analytical models can be brought to bear on the problems of combining military and civilian manpower into one management system. This includes a discussion of the computer support arrangements necessary to implement the models. First, we discuss an extension of multilevel models to provide an integrated approach to program planning which includes the dynamics of the manpower requirements-inventory relationships of mixed military-civilian manpower systems. Then, focus is given to some of the potential Navy applications particularly in terms of ways the outputs from the global multilevel model might be interfaced with assignment models for operational planning. The paper concludes with a discussion of static and dynamic multiattribute assignment models which operate on the individual man-job matching level. It is at this level of detail that dynamic mixed manpower systems might be constructed for use in equal employment opportunity planning and for local organization design studies.  相似文献   
329.
This paper provides a theoretical and computational comparison of alternative mixed integer programming formulations for optimization problems involving certain types of economy-of-scale functions. Such functions arise in a broad range of applications from such diverse areas as vendor selection and communications network design. A “nonstandard” problem formulation is shown to be superior in several respects to the traditional formulation of problems in this class.  相似文献   
330.
A new bivariate negative binomial distribution is derived by convoluting an existing bivariate geometric distribution; the probability function has six parameters and admits of positive or negative correlations and linear or nonlinear regressions. Given are the moments to order two and, for special cases, the regression function and a recursive formula for the probabilities. Purely numerical procedures are utilized in obtaining maximum likelihood estimates of the parameters. A data set with a nonlinear empirical regression function and another with negative sample correlation coefficient are discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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