全文获取类型
收费全文 | 371篇 |
免费 | 9篇 |
出版年
2021年 | 10篇 |
2019年 | 7篇 |
2017年 | 8篇 |
2016年 | 6篇 |
2015年 | 12篇 |
2014年 | 8篇 |
2013年 | 67篇 |
2010年 | 2篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 4篇 |
2003年 | 2篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1996年 | 5篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 7篇 |
1992年 | 7篇 |
1991年 | 8篇 |
1990年 | 2篇 |
1989年 | 7篇 |
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篇 |
排序方式: 共有380条查询结果,搜索用时 15 毫秒
301.
This article discusses the behavior of three continuous sampling plans: continuous sampling plan 1 (CSP 1) and continuous sampling plan 2 (CSP 2) developed by Dodge [5] and Dodge and Torrey [7], and multilevel continuous sampling plan 2 (MLP 2) developed by Lieberman and Solomon [11], when the quality of successive units in a continuous production process follows a two-state time-homogeneous Markov chain. We first derive the average outgoing quality (AOQ) expressions of these plans. Exact procedures for determining the average outgoing quality limit (AOQL) can be obtained only for CSP 1. For CSP 2 and MLP 2 plans, iterative procedures have been used to obtain the AOQL contours. For these plans, it is assumed that the serial correlation coefficient between the two consecutive random variables of the Markov chain is known. In addition, estimation procedures for the coefficient are given. We show that if the serial correlation coefficient of the Markov chain is positive (negative), the AOQL is increased (decreased) as compared to the case when the successive units in the production process follows a Bernoulli pattern. Let r denote the number of production units examined in succession which are found to be of good quality and k denote the inverse of the sampling fraction employed when quality is good. Then if r and k are sufficiently small, it is observed from the graph that, for small departures of the serial correlation coefficient from zero, the AOQL values do not differ significantly for each of the three plans; whereas for sufficiently large values of r and k, the AOQL values differ significantly. Various aspects of these plans, such as their operating characteristics 2 (OC 2) and the serial correlation coefficient, are discussed. 相似文献
302.
In this article we model a two-echelon (two levels of repair, one level of supply) repairable-item inventory system using continuous-time Markov processes. We analyze two models. In the first model we assume a system with a single base. In the second model we expand this model to include n bases. The Markov approach gives rise to multidimensional state spaces that are large even for relatively small problems. Because of this, we utilize aggregate/disaggregate techniques to develop a solution algorithm for finding the steady-state distribution. This algorithm is exact for the single-base model and is an approximation for the n-base model, in which case it is found to be very accurate and computationally very efficient. 相似文献
303.
Each year, more than $3 billion is wagered on the NCAA Division 1 men's basketball tournament. Most of that money is wagered in pools where the object is to correctly predict winners of each game, with emphasis on the last four teams remaining (the Final Four). In this paper, we present a combined logistic regression/Markov chain model for predicting the outcome of NCAA tournament games given only basic input data. Over the past 6 years, our model has been significantly more successful than the other common methods such as tournament seedings, the AP and ESPN/USA Today polls, the RPI, and the Sagarin and Massey ratings. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006. 相似文献
304.
Strategic Views from the Second Tien The Nuclear Weapons Policies of France, Britain and China. Edited by J.C. Hopkins and W Hu, New Brunswick and London, Transaction Publishers, (1995) ISBN 1-56000-7907. $ 21.95
Multinational Military Forces: Problems and Prospects. By Roger H. Palin. Adelphi Paper 294, 11SS/Oxford University Press (1995) ISBN 0-19-828025-4 ISSN 0567 932X
South Africa in the Global Economy. Edited by Greg Mills, et al. South African Institute of International Affairs, Johannesburg, (1995) ISBN 1-874890-58-7. R. 45.60
The Limits of Air Powen The American Bombing of North Vietnam. By Mark Clodfelter, The Free Press. New York (1989). ISBN 0-02-905990-9. $22.95.
Guy Gibson. By Richard Morris with Colin Dobinson. Viking. London (1994). ISBN 0-670-82878-5. £18.00.
Dambuster: A Life of Guy Gibson VC. By Susan Ottway. Leo Cooper, London (1994). ISBN 0-85052-427. £16-95. 相似文献
Multinational Military Forces: Problems and Prospects. By Roger H. Palin. Adelphi Paper 294, 11SS/Oxford University Press (1995) ISBN 0-19-828025-4 ISSN 0567 932X
South Africa in the Global Economy. Edited by Greg Mills, et al. South African Institute of International Affairs, Johannesburg, (1995) ISBN 1-874890-58-7. R. 45.60
The Limits of Air Powen The American Bombing of North Vietnam. By Mark Clodfelter, The Free Press. New York (1989). ISBN 0-02-905990-9. $22.95.
Guy Gibson. By Richard Morris with Colin Dobinson. Viking. London (1994). ISBN 0-670-82878-5. £18.00.
Dambuster: A Life of Guy Gibson VC. By Susan Ottway. Leo Cooper, London (1994). ISBN 0-85052-427. £16-95. 相似文献
305.
306.
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 相似文献
307.
We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
308.
309.
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. 相似文献
310.
In this article we develop a class of general knapsack problems which are hard for branch and bound algorithms. The number of alternate optimal solutions for these problems grows exponentially with problem parameters. In addition the LP bound is shown to be ineffective. Computational tests indicate that these problems are truly difficult for even very small problems. Implications for the testing of algorithms using randomly generated problems is discussed. 相似文献