全文获取类型
收费全文 | 88篇 |
免费 | 4篇 |
出版年
2020年 | 1篇 |
2019年 | 1篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2015年 | 3篇 |
2014年 | 2篇 |
2013年 | 20篇 |
2012年 | 1篇 |
2011年 | 1篇 |
2010年 | 1篇 |
2009年 | 2篇 |
2007年 | 2篇 |
2006年 | 2篇 |
2004年 | 3篇 |
2003年 | 1篇 |
2002年 | 3篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1988年 | 1篇 |
1987年 | 5篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1983年 | 2篇 |
1979年 | 1篇 |
1977年 | 3篇 |
1975年 | 1篇 |
1973年 | 2篇 |
1968年 | 1篇 |
1967年 | 2篇 |
排序方式: 共有92条查询结果,搜索用时 531 毫秒
41.
An MX/G/1 queueing system with disasters and repairs under a multiple adapted vacation policy
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We consider a queueing system with batch Poisson arrivals subject to disasters which occur independently according to a Poisson process but affect the system only when the server is busy, in which case the system is cleared of all customers. Following a disaster that affects the system, the server initiates a repair period during which arriving customers accumulate without receiving service. The server operates under a Multiple Adapted Vacation policy. The stationary regime of this process is analyzed using the supplementary variables method. We obtain the probability generating function of the number of customers in the system, the fraction of customers who complete service, and the Laplace transform of the system time of a typical customer in stationarity. The stability condition for the system and the Laplace transform of the time between two consecutive disasters affecting the system is obtained by analyzing an embedded Markov renewal process. The statistical characteristics of the batches that complete service without being affected by disasters and those of the partially served batches are also derived. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 171–189, 2015 相似文献
42.
Tests for homogeneity of distributions of component lifetimes from system lifetime data with known system signatures
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
In this article, we discuss the problem of testing the homogeneity of distributions of component lifetimes based on system lifetime data when the system signatures are known. Both parametric and nonparametric procedures are developed for this problem. For nonparametric testing, the Mann–Whitney‐type statistic is used, and its performance and limitations are discussed. Next, we assume the component lifetimes to follow exponential distributions and then develop different parametric tests. Exact and asymptotic methods are developed based on the method of moments estimators. A Monte Carlo simulation study is used to compare the performance of different parametric procedures with that of the nonparametric procedure. Based on the results of the simulation study, discussions and practical recommendations are made and finally some concluding remarks are provided. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 550–563, 2015 相似文献
43.
44.
We show that the linear objective function of a search problem can be generalized to a power function and/or a logarithmic function and still be minimized by an index priority rule. We prove our result by solving the differential equation resulting from the required invariance condition, therefore, we also prove that any other generalization of this linear objective function will not lead to an index priority rule. We also demonstrate the full equivalence between two related search problems in the sense that a solution to either one can be used to solve the other one and vice versa. Finally, we show that the linear function is the only function leading to an index priority rule for the single‐machine makespan minimization problem with deteriorating jobs and an additive job deterioration function. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
45.
We consider the problem of maximizing the number of on‐time jobs on two uniform parallel machines. We show that a straightforward extension of an algorithm developed for the simpler two identical parallel machines problem yields a heuristic with a worst‐case ratio bound of at least . We then show that the infusion of a “look ahead” feature into the aforementioned algorithm results in a heuristic with the tight worst‐case ratio bound of , which, to our knowledge, is the tightest worst‐case ratio bound available for the problem. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
46.
47.
A fundamental unsolved problem in the programming area is one in which various activities have fixed charges (e.g., set-up time charges) if operating at a positive level. Properties of a general solution to this type problem are discussed in this paper. Under special circumstances it is shown that a fixed charge problem can be reduced to an ordinary linear programming problem. 相似文献
48.
George R. Fitzpatrick Jerome Bracken Mary J. O'brien Lee G. Wentling Justin C. Whiton 《海军后勤学研究》1967,14(2):241-255
A linear programming model for analyzing the strategic deployment mix of airlift and sealift forces and prepositioning to accomplish the composite requirements of a set of possible contingencies is described in this paper. It solves for the least-cost mix of deployment means capable of meeting any one of a spectrum of contingencies, or meeting simultaneous contingencies. The model was developed by RAC as part of the U.S. Army's study program and has been used in analyses of deployment systems conducted in support of the U.S. Army, the Joint Chiefs of Staff and the Office of the Secretary of Defense. Results of analyses have influenced the preparation of long-range plans as well as the formulation of the FY67 Department of Defense budget. The paper gives the background and assumptions of the model, describes the model by means of a simple hypothetical example followed by a selected subset of a complete version, and discusses how the model is used. 相似文献
49.
50.