首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   794篇
  免费   12篇
  2021年   14篇
  2019年   11篇
  2017年   18篇
  2016年   15篇
  2015年   17篇
  2014年   16篇
  2013年   120篇
  2012年   23篇
  2011年   28篇
  2010年   23篇
  2009年   14篇
  2008年   31篇
  2007年   17篇
  2006年   19篇
  2005年   9篇
  2002年   8篇
  2001年   9篇
  1999年   5篇
  1998年   13篇
  1997年   14篇
  1996年   6篇
  1995年   10篇
  1994年   12篇
  1993年   16篇
  1992年   14篇
  1991年   14篇
  1990年   4篇
  1989年   19篇
  1988年   17篇
  1987年   16篇
  1986年   23篇
  1985年   16篇
  1984年   6篇
  1983年   10篇
  1982年   8篇
  1981年   14篇
  1980年   12篇
  1979年   20篇
  1978年   10篇
  1977年   11篇
  1976年   8篇
  1975年   15篇
  1974年   9篇
  1973年   7篇
  1972年   18篇
  1971年   7篇
  1970年   7篇
  1969年   14篇
  1968年   10篇
  1966年   6篇
排序方式: 共有806条查询结果,搜索用时 0 毫秒
651.
In this article we have generalized previous models on multiechelon recoverable inventory systems to cover the cases of batch ordering and shipment policy, and when items can either be repaired or condemned. The batch ordering and shipment policy is appropriate when the setup cost for shipment and order and/or the demand rates of the items are relatively high. The operating characteristics of such a system have been studied. Specifically, the probability distribution of backorder levels at the bases are analyzed for different repair-time distributions. An approximation scheme is proposed for this distribution, and is evaluated using extensive simulation results. The results indicate that the scheme is very effective in providing near-optimal stocking levels in such a system.  相似文献   
652.
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  相似文献   
653.
The existing literature on economic design of 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  相似文献   
654.
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  相似文献   
655.
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  相似文献   
656.
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  相似文献   
657.
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  相似文献   
658.
659.
In this paper a case study dealing with the maintenance problem of jib cranes is presented. A jib crane is viewed as a complex system whose performance is observed as a single realization over period of time. After pointing out limitations of existing stochastic models to analyze the observed realization a new family of bivariate stochastic processes is introduced. The data of jib crane is analyzed using new model and cross‐validated using part of the data set. It is noted that the new family of stochastic processes is useful to analyze bivariate data where one of the variables is finitely valued and the other is nonnegative and continuous. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 231–243, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10006  相似文献   
660.
This paper considers a problem of warranty reserving, namely, the current practice of setting aside part of a product revenue to meet future claims arising from the warranty. We define a Compound Poisson stochastic model for warranty claims and reserve and obtain, using a sample paths technique, the long-run probability distribution of a warranty reserves, managed under alternative warranties and reserve policies.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号