全文获取类型
收费全文 | 506篇 |
免费 | 17篇 |
出版年
2021年 | 10篇 |
2020年 | 5篇 |
2019年 | 13篇 |
2018年 | 5篇 |
2017年 | 7篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 7篇 |
2013年 | 77篇 |
2011年 | 6篇 |
2009年 | 6篇 |
2007年 | 15篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 5篇 |
1999年 | 10篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 10篇 |
1995年 | 4篇 |
1994年 | 9篇 |
1993年 | 13篇 |
1992年 | 11篇 |
1991年 | 13篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 18篇 |
1987年 | 8篇 |
1986年 | 15篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1982年 | 10篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 9篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 12篇 |
1973年 | 5篇 |
1972年 | 4篇 |
1971年 | 10篇 |
1970年 | 6篇 |
1969年 | 7篇 |
1968年 | 4篇 |
1967年 | 7篇 |
1948年 | 5篇 |
排序方式: 共有523条查询结果,搜索用时 15 毫秒
221.
In this paper, we consider the problem of minimizing the mean flow time of jobs to be processed on two machines. The jobs have a predetermined order, perhaps reflecting the order of arrival, and each job has a known processing time. We wish to assign the jobs to machines so as to minimize the mean flow time, with the constraint that the original order must be preserved within the subset of jobs assigned to each machine. An efficient algorithm based on dynamic programming is developed. 相似文献
222.
J. R. Callahan 《海军后勤学研究》1973,20(2):321-324
Sufficient conditions are developed for the ergodicity of a single server, first-come-first-serve queue with waiting time dependent service times. 相似文献
223.
A manpower planning model is presented that exploits the longitudinal stability of manpower cohorts. The manpower planning process is described. An infinite horizon linear program for calculating minimum cost manpower input plans is presented and found to have a straightforward solution in a great many cases and to yield an easily implemented approximation technique in other cases. 相似文献
224.
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. 相似文献
225.
This paper describes a method for determining optimal repair and replacement policies for aireraft, with specific reference to the F–4. The objective of the analysis is to choose the set of policies from all possible alternatives over a finite planning horizon which minimizes the cost of operations. A dynamic program is presented which seeks an optimal path through a series of decision periods, when each period begins with the choice of keeping an aircraft, reworking it before further operation, or buying a new one. We do not consider changes in technology. Therefore, when a replacement does occur, it is made with a similar aircraft. Multivariate statistical techniques are used to estimate the relevant costs as a function of age, and time since last rework. 相似文献
226.
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. 相似文献
227.
228.
229.
This paper concerns itself with the problem of estimating the parameters of one-way and two-way classification models by minimization of the sum of the absolute deviations of the regression function from the observed points. The one-way model reduces to obtaining a set of medians from which optimal parameters can be obtained by simple arithmetic manipulations. The two-way model is transformed into a specially structured linear programming problem, and two algorithms are presented to solve this problem. The occurrence of alternative optimal solutions in both models is discussed, and numerical examples are presented. 相似文献
230.
Nancy R. Mann 《海军后勤学研究》1978,25(1):121-128
Given herein is an easily implemented method for obtaining, from complete or censored data, approximate tolerance intervals associated with the upper tail of a Weibull distribution. These approximate intervals are based on point estimators that make essentially most efficient use of sample data. They agree extremely well with exact intervals (obtained by Monte Carlo simulation procedures) for sample sizes of about 10 or larger when specified survival proportions are sufficiently small. Ranges over which the error in the approximation is within 2 percent are determined. The motivation for investigation of the methodology for obtaining the approximate tolerance intervals was provided by the new formulation of Lanchester Combat Theory by Grubbs and Shuford [3], which suggests a Weibull assumption for time-to-incapacitation of key targets. With the procedures investigated herein, one can use (censored) data from battle simulations to obtain confidence intervals on battle times associated with given low survivor proportions of key targets belonging to either specified side in a future battle. It is also possible to calculate confidence intervals on a survival proportion of key targets corresponding to a given battle duration time. 相似文献