全文获取类型
收费全文 | 3347篇 |
免费 | 83篇 |
国内免费 | 1篇 |
出版年
2021年 | 37篇 |
2019年 | 89篇 |
2018年 | 51篇 |
2017年 | 82篇 |
2016年 | 78篇 |
2015年 | 61篇 |
2014年 | 65篇 |
2013年 | 709篇 |
2010年 | 35篇 |
2009年 | 37篇 |
2008年 | 48篇 |
2007年 | 53篇 |
2006年 | 36篇 |
2005年 | 43篇 |
2004年 | 56篇 |
2003年 | 42篇 |
2002年 | 57篇 |
1999年 | 41篇 |
1998年 | 46篇 |
1997年 | 48篇 |
1996年 | 61篇 |
1995年 | 41篇 |
1994年 | 59篇 |
1993年 | 64篇 |
1992年 | 58篇 |
1991年 | 74篇 |
1990年 | 39篇 |
1989年 | 72篇 |
1988年 | 78篇 |
1987年 | 70篇 |
1986年 | 72篇 |
1985年 | 64篇 |
1984年 | 36篇 |
1983年 | 42篇 |
1982年 | 43篇 |
1981年 | 46篇 |
1980年 | 51篇 |
1979年 | 46篇 |
1978年 | 49篇 |
1977年 | 45篇 |
1976年 | 45篇 |
1975年 | 46篇 |
1974年 | 52篇 |
1973年 | 50篇 |
1972年 | 52篇 |
1971年 | 43篇 |
1970年 | 40篇 |
1969年 | 40篇 |
1968年 | 34篇 |
1967年 | 34篇 |
排序方式: 共有3431条查询结果,搜索用时 15 毫秒
441.
M. Murat Kksalan 《海军后勤学研究》1999,46(7):777-789
We consider the problem of sequencing jobs on a single machine while minimizing a nondecreasing function of two criteria. We develop a heuristic procedure that quickly finds a good solution for bicriteria scheduling. The procedure is based on using several arcs in the criterion space that are representative of the possible locations of nondominated solutions. By sampling a small number of points on these arcs, a promising point is identified in the criterion space for each arc. An efficient sequence in the neighborhood of each of the promising points is found and the best of these efficient sequences is selected as the heuristic solution. We implement the procedure for two different bicriteria scheduling problems: (i) minimizing total flowtime and maximum tardiness and (ii) minimizing total flowtime and maximum earliness. The computational experience on a wide variety of problem instances show that the heuristic approach is very robust and yields good solutions. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 777–789, 1999 相似文献
442.
We develop a simple algorithm, which does not require convolutions, for computing the distribution of the residual life when the renewal process is discrete. We also analyze the algorithm for the particular case of lattice distributions, and we show how it can apply to an inventory problem. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 435–443, 1999 相似文献
443.
We measure the effectiveness of a repairable system by the proportion of time the system is on, where on-time and off-times are assumed independent and both gamma-distributed. This measure is helpful for system planning and control in the short term, before the steady-state is reached, and its mean value is intermediary between instantaneous and steady-state availabilities. We also present other significant results concerning the Gamma Alternating Renewal Process. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 822–844, 1999 相似文献
444.
Kenneth R. Baker 《海军后勤学研究》1999,46(8):978-991
This paper examines heuristic solution procedures for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup times between different job families. It reviews the state of knowledge about the solution of this problem, which is known to be difficult to solve in general, and examines natural solution approaches derived from some of the underlying theory. The emphasis is on the design and computational evaluation of new heuristic procedures. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 978–991, 1999 相似文献
445.
This article presents an approximate analytical method for evaluating an aircraft sortie generation process. The process is modeled as a closed network of multiserver queues and fork-join nodes that allow concurrent service activities. The model uses a variation of mean value analysis (MVA) to capture the effect of mean service times, resource levels, and network topology on performance measures including resource utilizations and the overall sortie generation rate. The quality of the analytical approximation is demonstrated through comparison with simulation results. © 1997 John Wiley & Sons, Inc. 1 This article is a US Government work and, as such, is in the public domain in the United States of America. Naval Research Logistics 44: 153–164, 1997 相似文献
446.
The Joint Replenishment Problem (JRP) involves production planning for a family of items. The items have a coordinated cost structure whereby a major setup cost is incurred whenever any item in the family is produced, and an item-specific minor setup cost is incurred whenever that item is produced. This paper investigates the performance of two types of cyclical production schedules for the JRP with dynamic demands over a finite planning horizon. The cyclical schedules considered are: (1) general cyclical schedules—schedules where the number of periods between successive production runs for any item is constant over the planning horizon—and (2) power-of-two schedules—a subset of cyclical schedules for which the number of periods between successive setups must be a power of 2. The paper evaluates the additional cost incurred by requiring schedules to be cyclical, and identifies problem characteristics that have a significant effect on this additional cost. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 577–589, 1997. 相似文献
447.
In this article we try to identify appropriate solution procedures for different types of multiechelon production planning problems. We conduct an extensive computational study on uncapacitated multiechelon production planning problems with serial and assembly types of bill-of-material structures. Problems are formulated as both single-source fixed charge network problems and as multicommodity flow problems with fixed charges. Solution procedures considered are branch and cut, Lagrangean relaxation (for the network formulation), and branch and bound (for the multicommodity formulation). Three hundred problems with various problem structures are tested. Our conclusions suggest the best approach for each type of problem structure. © 1997 John Wiley & Sons, Inc. 相似文献
448.
Allocation of spare components in a system in order to optimize the lifetime of the system with respect to a suitable criterion is of considerable interest in reliability, engineering, industry, and defense. We consider the problem of allocation of K active spares to a series system of independent and identical components in order to optimize the failure-rate function of the system. © 1997 John Wiley & Sons, Inc. 相似文献
449.
We present an air-defense engagement model to counter an attack by multiple antiship missiles, assuming perfect kill assessment. In this model, the probability of shooting down all incoming missiles is maximized. A generating function is employed to produce an algorithm which is used to evaluate the outcomes. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 687–697, 1997 相似文献
450.
The provision of Military Assistance to the Civil Powers (MACP) encapsulates the traditional approach towards countering terrorism on the British mainland, which emphasises minimum force, proportionality, police primacy and the rule of law, with the military retained as a supporting instrument, being employed only as a measure of last resort. Recent terrorist incidents in major urban centres do, however, question the effectiveness of these established methods. This analysis initially codifies the conceptual issues that underscore the tensions between civil policing and military anti-terrorist approaches in the UK, and proceeds to evaluate and compare a number of operations that indicate the nature of the challenges facing the MACP apparatus. In particular, potential shortcomings in the MACP provisions are identified in the form of threat perception and deployment and enforcement gaps. The assessment finds that there are facets of MACP that are of enduring relevance in the current era, yet a continuing need persists to reconcile police and military imperatives toward serious civil disorder contingencies and conditions of emergency. 相似文献