全文获取类型
收费全文 | 506篇 |
免费 | 9篇 |
出版年
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 7篇 |
2017年 | 12篇 |
2016年 | 17篇 |
2015年 | 10篇 |
2014年 | 8篇 |
2013年 | 73篇 |
2012年 | 23篇 |
2011年 | 28篇 |
2010年 | 21篇 |
2009年 | 15篇 |
2008年 | 30篇 |
2007年 | 14篇 |
2006年 | 17篇 |
2005年 | 8篇 |
2004年 | 5篇 |
2002年 | 5篇 |
2001年 | 4篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 12篇 |
1988年 | 5篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 7篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 7篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有515条查询结果,搜索用时 78 毫秒
481.
The problem posed in this paper is to sequence or route n jobs, each originating at a particular location or machine, undergoing r?1 operations or repairs, and terminating at the location or machine from which it originated. The problem is formulated as a 0-1 integer program, with block diagonal structure, comprised of r assignment subproblems; and a joint set of constraints to insure cyclical squences. To obtain integer results the solutions to each subproblem are ranked as required and combinations thereof are implicitly enumerated. The procedure may be terminated at any step to obtain an approximate solution. Some limited computational results are presented. 相似文献
482.
This paper is concerned with assigning and sequencing a set of activities for some or all members of a crew of operators so that the completion time of all such operations is minimized. It is assumed that each of the operators in the crew possesses, initially, certain tasks that only he can perform. A branch-and-bound scheme is proposed to treat the problem, and suitable computational experience is provided. 相似文献
483.
Thomas L. Saaty 《海军后勤学研究》1966,13(4):447-476
484.
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. 相似文献
485.
Recent research has led to several surrogate multiplier search procedures for use in a primal branch-and-bound procedure. As single constrained integer programming problems, the surrogate subproblems are also solved via branch-and-bound. This paper develops the inner play between the surrogate subproblem and the primal branch-and-bound trees which can be exploited to produce a number of computational efficiencies. Most important is a restarting procedure which precludes the need to solve numerous surrogate subproblems at each node of a primal branch-and-bound tree. Empirical evidence suggests that this procedure greatly reduces total computation time. 相似文献
486.
This paper examines problems of sequencing n jobs for processing by a single resource to minimize a function of job completion times, when the availability of the resource varies over time. A number of well-known results for single-machine problems which can be applied with little or no modification to the corresponding variable-resource problems are given. However, it is shown that the problem of minimizing the weighted sum of completion times provides an exception. 相似文献
487.
This paper provides an overview of the Computer-Assisted Search Planning (CASP) system developed for the United States Coast Guard. The CASP information processing methodology is based upon Monte Carlo simulation to obtain an initial probability distribution for target location and to update this distribution to account for drift due to currents and winds. A multiple scenario approach is employed to generate the initial probability distribution. Bayesian updating is used to reflect negative information obtained from unsuccessful search. The principal output of the CASP system is a sequence of probability “maps” which display the current target location probability distributions throughout the time period of interest. CASP also provides guidance for allocating search effort based upon optimal search theory. 相似文献
488.
During basis reinversion of either a product form or elimination form linear programming system, it may become necessary to swap spike columns to effect the reinversion and maintain the desired sparsity characteristics. This note shows that the only spikes which need be examined when an interchange is required are those not yet processed in the current external bump. 相似文献
489.
One way of achieving the increased levels of system reliability and availability demanded by critical computer-based control systems is through the use of fault-tolerant distributed computer systems. This article addresses the problem of allocating a set of m tasks among a set of n processors in a manner that will satisfy various task assignment, system capacity, and task scheduling constraints while balancing the workload across processors. We discuss problem background, problem formulation, and a known heuristic procedure for the problem. A new solution-improving heuristic procedure is introduced, and computational experience with the heuristics is presented. With only a modest increase in the amount of computational effort, the new procedure is demonstrated to improve dramatically solution quality as well as obtain near-optimal solutions to the test problems. 相似文献
490.
In this article we present some advanced basis or block-pivoting, relaxation, and feasible direction methods for solving linear programming problems. Preliminary computational results appear to indicate that the former two types of simplex-based procedures may hold promise for solving linear programming problems, unlike the third type of scheme which is shown to be computationally unattractive. 相似文献