全文获取类型
收费全文 | 89篇 |
免费 | 3篇 |
出版年
2021年 | 2篇 |
2017年 | 4篇 |
2015年 | 2篇 |
2013年 | 16篇 |
2011年 | 1篇 |
2010年 | 1篇 |
2008年 | 1篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2004年 | 2篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 4篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1976年 | 5篇 |
1975年 | 5篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1972年 | 3篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有92条查询结果,搜索用时 15 毫秒
61.
The Stein-Chen method for establishing Poisson convergence is used to approximate the reliability of coherent systems with exponential-type distribution functions. These bounds lead to quite general limit theorems for the lifetime distribution of large coherent systems. © 1993 John Wiley & Sons, Inc. 相似文献
62.
A classic problem in Search Theory is one in which a searcher allocates resources to the points of the integer interval [1, n] in an attempt to find an object which has been hidden in them using a known probability function. In this paper we consider a modification of this problem in which there is a protector who can also allocate resources to the points; allocating these resources makes it more difficult for the searcher to find an object. We model the situation as a two‐person non‐zero‐sum game so that we can take into account the fact that using resources can be costly. It is shown that this game has a unique Nash equilibrium when the searcher's probability of finding an object located at point i is of the form (1 − exp (−λixi)) exp (−μiyi) when the searcher and protector allocate resources xi and yi respectively to point i. An algorithm to find this Nash equilibrium is given. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:85–96, 2000 相似文献
63.
The problem of imperfect preventive maintenance (pm) and replacement schedule for a system which works below a specified failure rate is studied. For a given planning period, the optimal schedule for replacements to minimize the total cost is obtained. This article presents a branching algorithm with effective dominance rules to obtain the optimal schedule. Numerical illustration and computational experience are also presented. 相似文献
64.
65.
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. 相似文献
66.
The article considers a two-person competitive problem in which a traveller wishes to choose a path across a rectangle from left to right in such a way as to avoid being ambushed by his adversary who has placed obstacles within the rectangle. Our results supplement those that have already been obtained by Ruckle and they indicate that, under certain conditions, the players need to adopt rather sophisticated strategies if they are to act optimally. This suggests that a complete solution to the problem could be difficult. 相似文献
67.
The paper addresses the problem of a patrol trying to stop smugglers who are attempting to ship a cargo of perishable contraband across a strait in one of M time units. The situation was modeled as a two-person zero-sum game of exhaustion by Thomas and Nisgav and this article extends their results. The game has many characteristics in common with the Inspection Game in Owen's book on Game Theory; this Inspection Game is generalized and the relations between the two games are discussed. 相似文献
68.
Ananth. V. Iyer 《海军后勤学研究》2002,49(4):376-390
We evaluate an approach to decrease inventory costs at retail inventory locations that share a production facility. The retail locations sell the same product but differ in the variance of retail demand. Inventory policies at retail locations generate replenishment orders for the production facility. The production facility carries no finished goods inventory. Thus, production lead time for an order is the sojourn time in a single server queueing system. This lead time affects inventory costs at retail locations. We examine the impact of moving from a First Come First Served (FCFS) production rule for orders arriving at the production facility to a rule in which we provide non‐preemptive priority (PR) to orders from retail locations with higher demand uncertainty. We provide three approximations for the ratio of inventory costs under PR and FCFS and use them to identify conditions under which PR decreases retail inventory costs over FCFS. We then use a Direct Approach to establish conditions when PR decreases retail inventory costs over FCFS. We extend the results to orders from locations that differ in the mean and variance of demand uncertainty. The analysis suggests that tailoring lead times to product demand characteristics may decrease system inventory costs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 376–390, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10016 相似文献
69.
This study examines critically the various assumptions, results, and concepts that exist to date in the literature and scientific community concerning the relationships among the Lanchester, stochastic Lanchester, and the general renewal models of combat. Many of the prevailing understandings are shown to be erroneous. 相似文献
70.
T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = 1,…, N, functions when at least Ki of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest Ki and allocates functioning components to subsystems in increasing order of the Ki's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the Ki's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues. © John Wiley & Sons, Inc. Naval Research Logistics 48: 732–746, 2001 相似文献