全文获取类型
收费全文 | 638篇 |
免费 | 13篇 |
出版年
2021年 | 11篇 |
2020年 | 6篇 |
2019年 | 25篇 |
2018年 | 18篇 |
2017年 | 16篇 |
2016年 | 16篇 |
2015年 | 15篇 |
2014年 | 12篇 |
2013年 | 153篇 |
2009年 | 6篇 |
2008年 | 7篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 10篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 8篇 |
1999年 | 6篇 |
1998年 | 12篇 |
1997年 | 19篇 |
1996年 | 11篇 |
1994年 | 13篇 |
1992年 | 7篇 |
1991年 | 16篇 |
1990年 | 7篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 15篇 |
1986年 | 12篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 8篇 |
1982年 | 11篇 |
1981年 | 5篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1973年 | 13篇 |
1972年 | 7篇 |
1971年 | 7篇 |
1970年 | 7篇 |
1969年 | 6篇 |
1968年 | 7篇 |
1967年 | 5篇 |
排序方式: 共有651条查询结果,搜索用时 15 毫秒
601.
James A. M. McHugh 《海军后勤学研究》1984,31(3):409-411
This article presents a simple proof of Hu's algorithm for scheduling in minimum time a set of tasks constrained by precedence tree constraints, each task requiring a unit time to complete, and where m processors are available. 相似文献
602.
Consider a central depot that supplies several locations experiencing random demands. Periodically, the depot may place an order for exogenous supply. Orders arrive after a fixed leadtime, and are then allocated among the several locations. Each allocation reaches its destination after a further delay. We consider the special case where the penalty-cost/holding-cost ratio is constant over the locations. Several approaches are given to approximate the dynamic program describing the problem. Each approach provides both a near-optimal order policy and an approximation of the optimal cost of the original problem. In addition, simple but effective allocation policies are discussed. 相似文献
603.
604.
Work by the present authors on life distributions derived from stochastic hazard functions [4] is related to certain articles that have appeared in this journal. This relationship is illustrated. The emphasis of this article is upon problems of parameter estimation. 相似文献
605.
A branch and bound algorithm is developed for a class of allocation problems in which some constraint coefficients depend on the values of certain of the decision variables. Were it not for these dependencies, the problems could be solved by linear programming. The algorithm is developed in terms of a strategic deployment problem in which it is desired to find a least-cost transportation fleet, subject to constraints on men/materiel requirements in the event of certain hypothesized contingencies. Among the transportation vehicles available for selection are aircraft which exhibit the characteristic that the amount of goods deliverable by an aircraft on a particular route in a given time period (called aircraft productivity and measured in kilotons/aircraft/month) depends on the ratio of type 1 to type 2 aircraft used on that particular route. A model is formulated in which these relationships are first approximated by piecewise linear functions. A branch and bound algorithm for solving the resultant nonlinear problem is then presented; the algorithm solves a sequence of linear programming problems. The algorithm is illustrated by a sample problem and comments concerning its practicality are made. 相似文献
606.
A modification to the Dantzig and Fulkerson Tanker Scheduling Problem is described. An insufficient number of vehicles and a utility associated with each vehicle delivery are assumed. The new problem is shown to be equivalent to a Transshipment Problem, the solution of which is the same as the maximal utility solution of the modified Tanker Scheduling Problem. An example is given. 相似文献
607.
Paul D. Berger 《海军后勤学研究》1972,19(1):159-164
This paper poses a prediction problem in which a linear model is assumed. With a “zero-one” loss structure as the loss from incorrect prediction, it is suggested that least squares may not be appropriate for estimating the parameters of the model. An alternate criterion is proposed and integer programming is used in order to find the estimates, given the proposed criterion. 相似文献
608.
We consider the scheduling of n tasks on a single resource. Each task becomes available for processing at time ai, must be completed by time bi, and requires di time units for processing. The aim is to find a schedule that minimizes the elapsed time to complete all jobs. We present solution algorithms for this problem when job splitting is permitted and when job splitting is not permitted. Then we consider several scheduling situations which arise in practice where these models may apply. 相似文献
609.
610.
Tuncel M. Yegulalp 《海军后勤学研究》1975,22(4):697-712
This paper introduces a special control chart procedure for exponentially distributed product life. Statistical control of product life in manufacturing requires continuing life tests of manufactured product so as to detect changes in product life and take appropriate corrective action. These life testing experiments may become exceedingly time consuming and thus can be both impractical because of serious time delays in implementing corrective action on the process when indicated, and quite uneconomical. It is desirable to inquire into the character of life testing by means of a control chart procedure based on the real time to first failure within given samples. Measuring the real minimum life provides a considerable reduction in duration of the testing procedure and in the number of specimens destroyed, yielding a considerable economy over the Shewhart's X control chart. 相似文献