全文获取类型
收费全文 | 563篇 |
免费 | 14篇 |
出版年
2021年 | 8篇 |
2019年 | 11篇 |
2018年 | 9篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 7篇 |
2014年 | 10篇 |
2013年 | 122篇 |
2012年 | 5篇 |
2011年 | 6篇 |
2009年 | 8篇 |
2008年 | 5篇 |
2007年 | 13篇 |
2006年 | 6篇 |
2005年 | 9篇 |
2004年 | 7篇 |
2003年 | 8篇 |
2002年 | 9篇 |
2000年 | 5篇 |
1999年 | 5篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 12篇 |
1995年 | 7篇 |
1994年 | 10篇 |
1993年 | 14篇 |
1992年 | 13篇 |
1991年 | 11篇 |
1990年 | 12篇 |
1989年 | 20篇 |
1988年 | 17篇 |
1987年 | 11篇 |
1986年 | 14篇 |
1985年 | 9篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 9篇 |
1980年 | 8篇 |
1979年 | 10篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 7篇 |
1974年 | 8篇 |
1973年 | 6篇 |
1971年 | 8篇 |
1970年 | 7篇 |
1969年 | 5篇 |
1967年 | 7篇 |
1948年 | 4篇 |
排序方式: 共有577条查询结果,搜索用时 0 毫秒
241.
242.
243.
Military Helicopters. By E. J. Everett‐Heath, G. M. Moss, A. W. Mowat and K. E. Reid. Brassey's, London (1990), ISBN 0–08–037341–0 (hardcover), ISBN 0–08–036716‐X (flexicover), £22.50 (hardcover), £12.95 (flexicover)
The Killing Ground: the British Army, the Western Front and the Emergence of Modern Warfare 1900–1918. By Tim Travers. Unwin‐Hyman, London (1990), ISBN 0–04–4457367, £11.95
The Influence of S. L. A. Marshall on the United States Army. By Major F. D. G. Williams. TRADOC Historical Monograph Series, Fort Monroe, VA (1990) 相似文献
244.
We consider the scheduling of n jobs on m identical machines when the jobs become available for processing at ready times ai, ai, ? 0, require di time units for processing and must be completed by times bi for i = 1, 2, … n. The objective chosen is that of minimizing the total elapsed time to complete all jobs subject to the ready time and due date constraints, preemption is not allowed. We present a multi-stage solution algorithm for this problem that is based on an implicit enumeration procedure and also uses the labelling type algorithm which solves the problem when preemption is allowed. 相似文献
245.
In this paper we present some results in parametric studies on several transportation-type problems. Specifically, a characterization is obtained for the optimal values of the variables in the problem of determining an optimal growth path in a logistics system. We also derive an upper bound beyond which the optimal growth path remains the same. The results are then extended to the goal programming model and the prespecified market growth rate problem. 相似文献
246.
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. 相似文献
247.
Recent efforts to improve lower bounds in implicit enumeration algorithms for the general (n/m/G/Fmax) sequencing problem have been directed to the solution of an auxiliary single machine problem that results from the relaxation of some of the interference constraints. We develop an algorithm that obtains optimal and near optimal solutions for this relaxed problem with relatively little computational effort. We report on computational results achieved when this method is used to obtain lower bounds for the general problem. Finally, we show the equivalence of this problem to a single machine sequencing problem with earliest start and due date constraints where the objective is to minimize the maximum lateness. 相似文献
248.
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. 相似文献
249.
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. 相似文献
250.