全文获取类型
收费全文 | 378篇 |
免费 | 9篇 |
出版年
2021年 | 10篇 |
2019年 | 7篇 |
2017年 | 8篇 |
2016年 | 7篇 |
2015年 | 11篇 |
2014年 | 8篇 |
2013年 | 70篇 |
2010年 | 2篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 4篇 |
2003年 | 2篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 9篇 |
1997年 | 8篇 |
1996年 | 5篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 7篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1990年 | 2篇 |
1989年 | 8篇 |
1988年 | 14篇 |
1987年 | 6篇 |
1986年 | 15篇 |
1985年 | 9篇 |
1984年 | 6篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1976年 | 2篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1973年 | 5篇 |
1972年 | 7篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 6篇 |
1968年 | 3篇 |
1967年 | 2篇 |
1966年 | 3篇 |
排序方式: 共有387条查询结果,搜索用时 15 毫秒
311.
312.
Once dismissed by many outside observers, the Chinese People’s Liberation Army Air Force (PLAAF) has undergone an impressive transformation over the past two decades, emerging as one of the world’s premier air forces. As it continues to modernize, it is focused on becoming a ‘strategic air force.’ PLAAF strategists suggest this means it should play a decisive role in protecting Chinese national interests, field modern capabilities commensurate with China’s standing as a major power, and enjoy the institutional status befitting its role as a ‘strategic service,’ an important consideration given the historical dominance of the ground force in China’s military. 相似文献
313.
We consider a single-machine scheduling problem in which all jobs have the same due date and penalties are assessed for both early and late completion of jobs. However, earliness and tardiness are penalized at different rates. The scheduling objective is to minimize either the weighted sum of absolute deviations (WSAD) or the weighted sum of squared deviations (WSSD). For each objective we consider two versions of the problem. In the unconstrained version an increase in the due date does not yield any further decrease in the objective function. We present a constructive algorithm for the unconstrained WSAD problem and show that this problem is equivalent to the two-parallel, nonidentical machine, mean flow-time problem. For the unconstrained WSSD and the constrained WSAD and WSSD problems we propose implicit enumeration procedures based on several dominance conditions. We also report on our computational experience with the enumeration procedures. 相似文献
314.
Building evacuation problems can be represented as dynamic network-flow problems [3]. The underlying network structure of a building evolves through time yielding a time-expanded network (a dynamic network). Usually in such evacuation problems involving time, more than one objective function is appropriate. For example, minimizing the total evacuation time and evacuating a portion of the building as early as possible are two such objectives. In this article we show that lexicographical optimization is applicable in handling such multiple objectives. Minimizing the total evacuation time while avoiding cyclic movements in a building and “priority evacuation” are treated as lexicographical min cost flow problems. 相似文献
315.
Acceptance sampling plans are used to assess the quality of an ongoing production process, in addition to the lot acceptance. In this paper, we consider sampling inspection plans for monitoring the Markov‐dependent production process. We construct sequential plans that satisfy the usual probability requirements at acceptable quality level and rejectable quality level and, in addition, possess the minimum average sample number under semicurtailed inspection. As these plans result in large sample sizes, especially when the serial correlation is high, we suggest new plans called “systematic sampling plans.” The minimum average sample number systematic plans that satisfy the probability requirements are constructed. Our algorithm uses some simple recurrence relations to compute the required acceptance probabilities. The optimal systematic plans require much smaller sample sizes and acceptance numbers, compared to the sequential plans. However, they need larger production runs to make a decision. Tables for choosing appropriate sequential and systematic plans are provided. The problem of selecting the best systematic sampling plan is also addressed. The operating characteristic curves of some of the sequential and the systematic plans are compared, and are observed to be almost identical. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 451–467, 2001 相似文献
316.
Timothy S. Vaughan 《海军后勤学研究》1999,46(6):597-612
The existing literature on economic design of X̄ process control charts generally assumes perfect process adjustment, such that the process mean is returned to an exactly centered “in control” state following any real or false alarm control chart signal. This paper presents a model which demonstrates the effects of imperfect process adjustment on the economically designed control chart parameters. The model demonstrates that the optimal control limit width depends fundamentally on the precision with which the process can be adjusted. The greater the process adjustment error, all else constant, the wider will be the optimal control limits, in order to alleviate the potential for process overcontrol and tampering effects. By endogenously modeling these effects, the new model helps to rectify the problem of poor statistical properties for which the economic design approach has been criticized. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 597–612, 1999 相似文献
317.
A number of results pertaining to preservation of aging properties (IFR, IFRA etc.) under various shock models are available in the literature. Our aim in this paper is to examine in the same spirit, the preservation of unimodality under various shock models. For example, it is proved that in a non-homogeneous Poisson shock model if {pk}K≥0, the sequence of probabilities with which the device fails on the kth shock, is unimodal then under some suitable conditions on the mean value function Λ (t), the corresponding survival function is also unimodal. The other shock models under which the preservation of unimodality is considered in this paper are pure birth shock model and a more general shock model in which shocks occur according to a general counting process. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 952–957, 1999 相似文献
318.
We describe the development of a heuristic algorithm for determining efficient 2-dimensional packings in cargo aircraft where cargo placement constraints are critically important in determining the feasibility of packing locations. We review the performance of a new algorithm versus some traditional ones for aircraft loading. The algorithm is also tested in a more generalized setting where there exist no additional constraints on items, to suggest applicability in other environments. The new algorithm has been used worldwide in the Automated Air Load Planning System (AALPS) for cargo aircraft loading, with much success. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 751–768, 1998 相似文献
319.
In this paper, we consider a general covering problem in which k subsets are to be selected such that their union covers as large a weight of objects from a universal set of elements as possible. Each subset selected must satisfy some structural constraints. We analyze the quality of a k-stage covering algorithm that relies, at each stage, on greedily selecting a subset that gives maximum improvement in terms of overall coverage. We show that such greedily constructed solutions are guaranteed to be within a factor of 1 − 1/e of the optimal solution. In some cases, selecting a best solution at each stage may itself be difficult; we show that if a β-approximate best solution is chosen at each stage, then the overall solution constructed is guaranteed to be within a factor of 1 − 1/eβ of the optimal. Our results also yield a simple proof that the number of subsets used by the greedy approach to achieve entire coverage of the universal set is within a logarithmic factor of the optimal number of subsets. Examples of problems that fall into the family of general covering problems considered, and for which the algorithmic results apply, are discussed. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 615–627, 1998 相似文献
320.
We discuss the problem of scheduling several jobs on a single machine with the objective of minimizing the weighted mean absolute deviation of flow times around the weighted mean flow time. We first show that the optimal schedule is W-shaped. For the unweighted case, we show that all optimal schedules are V-shaped. This characterization enables us to show that the problem is NP-hard. We then provide a pseudopolynomial algorithm for the unweighted problem. Finally, we consider three heuristic algorithms for the unweighted problem and report computational experience with these algorithms. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 297–311, 1998 相似文献