全文获取类型
收费全文 | 596篇 |
免费 | 13篇 |
出版年
2019年 | 15篇 |
2018年 | 9篇 |
2017年 | 11篇 |
2016年 | 12篇 |
2015年 | 11篇 |
2014年 | 6篇 |
2013年 | 125篇 |
2011年 | 6篇 |
2010年 | 8篇 |
2007年 | 6篇 |
2006年 | 7篇 |
2005年 | 13篇 |
2004年 | 9篇 |
2003年 | 5篇 |
2001年 | 5篇 |
2000年 | 9篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 10篇 |
1996年 | 14篇 |
1995年 | 6篇 |
1994年 | 10篇 |
1993年 | 8篇 |
1992年 | 12篇 |
1991年 | 17篇 |
1990年 | 9篇 |
1989年 | 13篇 |
1988年 | 11篇 |
1987年 | 14篇 |
1986年 | 12篇 |
1985年 | 14篇 |
1984年 | 9篇 |
1983年 | 9篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 11篇 |
1978年 | 9篇 |
1977年 | 9篇 |
1976年 | 11篇 |
1975年 | 7篇 |
1974年 | 11篇 |
1973年 | 10篇 |
1972年 | 12篇 |
1971年 | 14篇 |
1970年 | 6篇 |
1969年 | 8篇 |
1968年 | 5篇 |
1967年 | 6篇 |
1966年 | 5篇 |
排序方式: 共有609条查询结果,搜索用时 62 毫秒
81.
This paper develops and applies a nonparametric bootstrap methodology for setting inventory reorder points and a simple inequality for identifying existing reorder points that are unreasonably high. We demonstrate that an empirically based bootstrap method is both feasible and calculable for large inventories by applying it to the 1st Marine Expeditionary Force General Account, an inventory consisting of $20–30 million of stock for 10–20,000 different types of items. Further, we show that the bootstrap methodology works significantly better than the existing methodology based on mean days of supply. In fact, we demonstrate performance equivalent to the existing system with a reduced inventory at one‐half to one‐third the cost; conversely, we demonstrate significant improvement in fill rates and other inventory performance measures for an inventory of the same cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 459–478, 2000 相似文献
82.
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000 相似文献
83.
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 相似文献
84.
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 相似文献
85.
An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
86.
We examine two key stochastic processes of interest for warranty modeling: (1) remaining total warranty coverage time exposure and (2) warranty load (total items under warranty at time t). Integral equations suitable for numerical computation are developed to yield probability law for these warranty measures. These two warranty measures permit warranty managers to better understand time‐dependent warranty behavior, and thus better manage warranty cash reserves. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
87.
88.
The (standard) randomization method is an attractive alternative for the transient analysis of continuous time Markov models. The main advantages of the method are numerical stability, well‐controlled computation error, and ability to specify the computation error in advance. However, the fact that the method can be computationally very expensive limits its applicability. In this paper, we develop a new method called split regenerative randomization, which, having the same good properties as standard randomization, can be significantly more efficient. The method covers reliability‐like models with a particular but quite general structure and requires the selection of a subset of states and a regenerative state satisfying some conditions. For a class of continuous time Markov models, model class C2, including typical failure/repair reliability‐like models with exponential failure and repair time distributions and deferred repair, natural selections are available for both the subset of states and the regenerative state and, for those natural selections, theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. Those results can be used to anticipate when the method can be expected to be competitive. We illustrate the application of the method using a large class C2 model and show that for models in that class the method can indeed be significantly more efficient than previously available randomization‐based methods. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
89.
The UK Ministry of Defence is British industry's largest single customer and a number of firms and industries are highly dependent on defence sales. Various hypotheses have been proposed about the impact of defence procurement on firms and these are investigated using four performance indicators: financial structure, investment, productivity and profitability. With regard to the borrowing ratio, capital investment and the rate of return, there is no statistically significant difference between the mean financial ratios for low and high dependence firms. However, non‐dependents appear to have a higher level and rate of growth of labour productivity than dependents. 相似文献
90.