首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   584篇
  免费   1篇
  585篇
  2021年   10篇
  2019年   8篇
  2018年   9篇
  2017年   12篇
  2016年   14篇
  2015年   13篇
  2014年   10篇
  2013年   147篇
  2010年   5篇
  2008年   5篇
  2007年   4篇
  2006年   5篇
  2005年   8篇
  2003年   6篇
  2002年   10篇
  2001年   6篇
  2000年   7篇
  1999年   7篇
  1998年   9篇
  1997年   12篇
  1996年   7篇
  1995年   7篇
  1994年   11篇
  1993年   12篇
  1992年   10篇
  1991年   11篇
  1990年   4篇
  1989年   10篇
  1988年   15篇
  1987年   12篇
  1986年   18篇
  1985年   9篇
  1984年   8篇
  1983年   6篇
  1982年   6篇
  1981年   10篇
  1980年   6篇
  1979年   12篇
  1978年   11篇
  1977年   8篇
  1976年   5篇
  1975年   10篇
  1974年   10篇
  1973年   5篇
  1972年   9篇
  1971年   7篇
  1970年   6篇
  1969年   7篇
  1968年   5篇
  1966年   4篇
排序方式: 共有585条查询结果,搜索用时 0 毫秒
61.
The problem considered is that of finding the set of efficient sequences of jobs on a single machine with respect to the total flow time and the number of tardy jobs. We present some properties of an existing algorithm and the problem itself.  相似文献   
62.
The general solution process of the Hitchcock transportation problem resulting from the application of the method of reduced matrices may give solutions with some negative xij values. This paper is devoted to a review of the reduced matrices method, an examination of suitable interpretation of sets of xij which include some negative values, and ways of interpreting these values in useful modifications of the Hitchcock problem. Such modifications include a) the reshipment problem, b) the overshipment problem, and c) the transshipment problem. Techniques are developed for determining and eliminating cij which are not optimal. These techniques and results are useful in solving the problems indicated above. The natural applicability of the simple and general method of reduced matrices is emphasized.  相似文献   
63.
Johnson [2] in 1954 solved the two machine flow shop problem by giving an argument for a sufficient condition of optimality and by stating an efficient algorithm which produces a solution via satisfaction of the sufficient condition. Moreover, Johnson solved two special cases of the corresponding three machine flow shop problem. Since that time, six other special cases have been solved, two contributed by Arthanari and Mukhopadhyay [1], two by Smith, Panwalkar, and Dudek [3], and two of a different nature by Szwarc [5]. This paper contributes an extension to one of the classes described by Szwarc.  相似文献   
64.
Inventory systems with returns are systems in which there are units returned in a repairable state, as well as demands for units in a serviceable state, where the return and demand processes are independent. We begin by examining the control of a single item at a single location in which the stationary return rate is less than the stationary demand rate. This necessitates an occasional procurement of units from an outside source. We present a cost model of this system, which we assume is managed under a continuous review procurement policy, and develop a solution method for finding the policy parameter values. The key to the analysis is the use of a normally distributed random variable to approximate the steady-state distribution of net inventory. Next, we study a single item, two echelon system in which a warehouse (the upper echelon) supports N(N ? 1) retailers (the lower echelon). In this case, customers return units in a repairable state as well as demand units in a serviceable state at the retailer level only. We assume the constant system return rate is less than the constant system demand rate so that a procurement is required at certain times from an outside supplier. We develop a cost model of this two echelon system assuming that each location follows a continuous review procurement policy. We also present an algorithm for finding the policy parameter values at each location that is based on the method used to solve the single location problem.  相似文献   
65.
A cutting plane scheme embedded in an implicit enumeration framework is proposed for ranking the extreme points of linear assignment problems. This method is capable of ranking any desired number of extreme points at each possible objective function value. The technique overcomes storage difficulties by being able to perform the ranking at any particular objective function value independently of other objective values. Computational experience on some test problems is provided.  相似文献   
66.
In this study we interpret the exterior penalty function method as a generalized lagrangian metliod which fills duality gaps in nonconvex problems. Geometry and resolution of these gaps from a duality point of view are highlighted.  相似文献   
67.
Suppose X is a random variable having an absolutely continuous distribution function F(x). We assume that F(x) has the Wald distribution. A relation between the probability density function of X−1 with that of X is used to characterize the Wald distribution.  相似文献   
68.
Capacity expansion models typically minimize the discounted cost of acquisition and operation over a given planning horizon. In this article we generalize this idea to one in which a capital supply curve replaces the usual discount rate. A capital supply curve is a means to model financial outlook, investment limits, and risk. We show that when such a curve is included in a capacity expansion model, it will, under certain conditions, provide a less capital intensive solution than one which incorporates a discount rate. In this article, we also provide an algorithm that solves capacity expansion models that incorporate a capital supply curve. The attractive feature of this algorithm is that it provides a means to utilize the “discount rate” models efficiently. Throughout, we give applications in power generation planning and computational experience for this application is also presented.  相似文献   
69.
In this article, we are concerned with scheduling stochastic jobs in a flowshop with m machines and zero intermediate storage. We assume that there are n - 2 identically distributed and 2 fast stochastic jobs. Roughly, the main result states that the makespan is stochastically minimized by placing one of the fast jobs first and the other last.  相似文献   
70.
In this article we consider a project scheduling problem where there are cash flows throughout the life of the project and where shorter activity durations can be attained by incurring greater direct costs. In particular, the objective of this problem is to determine the activity durations and a schedule of activity start times so that the net present value of cash flows is maximized. We formulate this problem as a mixed-integer nonlinear program which is amenable to solution using the generalized Benders decomposition technique developed by Geoffrion. We test the algorithm on 140 project scheduling problems, the largest of which contains 30 nodes and 64 activities. Our computational results are quite encouraging inasmuch as 123 of the 140 problems require less than 1 CPU second of solution time. © 1993 John Wiley & Sons, Inc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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