全文获取类型
收费全文 | 671篇 |
免费 | 18篇 |
国内免费 | 1篇 |
出版年
2021年 | 15篇 |
2019年 | 16篇 |
2018年 | 7篇 |
2017年 | 11篇 |
2016年 | 8篇 |
2015年 | 15篇 |
2014年 | 13篇 |
2013年 | 111篇 |
2009年 | 8篇 |
2008年 | 14篇 |
2006年 | 10篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 11篇 |
2000年 | 7篇 |
1998年 | 15篇 |
1997年 | 12篇 |
1996年 | 14篇 |
1995年 | 12篇 |
1994年 | 10篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 16篇 |
1990年 | 10篇 |
1989年 | 13篇 |
1988年 | 22篇 |
1987年 | 13篇 |
1986年 | 21篇 |
1985年 | 15篇 |
1984年 | 11篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 14篇 |
1979年 | 15篇 |
1978年 | 13篇 |
1977年 | 11篇 |
1976年 | 7篇 |
1975年 | 14篇 |
1974年 | 11篇 |
1973年 | 7篇 |
1972年 | 10篇 |
1971年 | 10篇 |
1970年 | 8篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1967年 | 6篇 |
1966年 | 8篇 |
排序方式: 共有690条查询结果,搜索用时 46 毫秒
651.
Jatinder N. D. Gupta 《海军后勤学研究》1976,23(2):235-243
In this paper the problem of finding an optimal schedule for the n-job, M-machine flowshop scheduling problem is considered when there is no intermediate space to hold partially completed jobs and the objective function is to minimize the weighted sum of idle times on all machines. By assuming that jobs are processed as early as possible, the problem is modeled as a traveling salesman problem and solved by known solution techniques for the traveling salesman problem. A sample problem is solved and a special case, one involving only two machines, is discussed. 相似文献
652.
Recent efforts in the field of dynamic programming have explored the feasibility of solving certain classes of integer programming problems by recursive algorithms. Special recursive algorithms have been shown to be particularly effective for problems possessing a 0–1 attribute matrix displaying the “nesting property” studied by, Ignall and Veinott in inventory theory and by Glover in network flows. This paper extends the class of problem structures that has been shown amenable to recursive exploitation by providing an efficient dynamic programming approach for a general transportation scheduling problem. In particular, we provide alternative formulations lor the scheduling problem and show how the most general of these formulations can be readily solved vis a vis recursive techniques. 相似文献
653.
This paper investigates the problem of choosing between two simple hypothesis, H0 and H1, in terms of independent, identically distributed random variables, when observations can be taken in groups. At any stage in the decision process it must be decided whether to stop and take action now or to continue, in which case the size of the next group of observations must be decided upon. The problem is to find an optimal procedure incorporating a stopping, group size (batch) and terminal action rule. It is proven, in general, that the optimal stopping and terminal action rule is of the sequential probability ratio type (SPRT). Fixed stopping rules of the SPRT type are studied and an iterative procedure of the policy improvement type, both with and without a value determination step, is developed. It is shown, for the general situation, that both the average risk and scheduling rule converge to the optima. Also, six suboptimal scheduling rules are considered with respect to the average risks they achieve. Numerical results are presented to illustrate the effectiveness of the procedures. 相似文献
654.
P. S. Dwyer 《海军后勤学研究》1974,21(3):445-464
This paper is designed to treat (a) the problem of the determination of the absolute minimum cost, with the associated assignments, when there is no limit, N, on the number of parcels available for shipment in a modified Hitchcock problem. This is accomplished with the use of a transformed cost matrix. C*, to which the so-called transportation paradox does not apply. The general Hitchcock solution using C* gives the cost T*, which is the absolute minimum cost of the original problem, as well as sets of assignments which are readily transformed to give the general assignments of the original problem. The sum of these latter assignments gives the value of Nu, the unbounded N for minimum cost. In addition, this paper is designed to show (b) how the method of reduced matrices may be used, (c) how a particular Hitchcock solution can be used to determine a general solution so that one solution using C* can provide the general answer, (d) how the results may be modified to apply to problems with fixed N, and hence (e) to determine the function of the decreasing T as N approaches Nu, and finally (f) to provide a treatment when the supplies at origin i and/or the demands at destination j, are bounded. 相似文献
655.
656.
657.
The location-allocation problem for existing facilities uniformly distributed over rectangular regions is treated for the case where the rectilinear norm is used. The new facilities are to be located such that the expected total weighted distance is minimized. Properties of the problem are discussed. A branch and bound algorithm is developed for the exact solution of the problem. Computational results are given for different sized problems. 相似文献
658.
It is well known that a minimal makespan permutation sequence exists for the n × 3 flow shop problem and for the n × m flow shop problem with no inprocess waiting when processing times for both types of problems are positive. It is shown in this paper that when the assumption of positive processing times is relaxed to include nonnegative processing times, optimality of permutation schedules cannot be guaranteed. 相似文献
659.
William S. Griffith 《海军后勤学研究》1982,29(1):63-74
In a 1973 paper J. D. Esary, A. W. Marshall, and F. Proschan [5] considered a shock model giving rise to various nonparametric classes of life distributions of interest in reliability theory. A number of authors have extended these results in a variety of directions. In this paper, alternative proofs of the increasing failure rate (IFR) and decreasing mean residual life (DMRL) results are given which do not make use of the theory of total positivity. Some bivariate extensions are then obtained using a shock model similar to that originally used by H. W. Block, A. S. Paulson, and R. C. Kohberger [2] to unify various bivariate exponential distributions. 相似文献
660.
An inventory of physical goods or storage space (in a communications system buffer, for instance) often experiences “all or nothing” demand: if a demand of random size D can be immediately and entirely filled from stock it is satisfied, but otherwise it vanishes. Probabilistic properties of the resulting inventory level are discussed analytically, both for the single buffer and for multiple buffer problems. Numerical results are presented. 相似文献