全文获取类型
收费全文 | 104篇 |
免费 | 3篇 |
出版年
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 26篇 |
2011年 | 1篇 |
2010年 | 1篇 |
2009年 | 1篇 |
2007年 | 2篇 |
2006年 | 2篇 |
2004年 | 2篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 3篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 5篇 |
1983年 | 2篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 3篇 |
1973年 | 3篇 |
1972年 | 1篇 |
1968年 | 1篇 |
1967年 | 2篇 |
排序方式: 共有107条查询结果,搜索用时 15 毫秒
1.
The Quality Measurement Plan (QMP) and the Universal Sampling Plan (USP) are the data analysis and sampling plans for the AT&T Technologies quality audit. This article describes QMP/USP, an acceptance sampling plan based on QMP and USP principles. QMPIUSP is a complete acceptance sampling system. It combines the elements of classical rectification inspection plans with those of MIL-STD-IOSD. There is no switching between plans, no tables of numbers to look through, and no discontinue state. QMP/USP is a computerized, self-contained system that features:
- Acceptance decisions based on the QMP Bayes empirical Bayes analysis of current and past sampling result
- Sample size selection based on USP, i.e., lot size, AQL, a cost ratio, the QMP analysis, and a budget constraint
- Guaranteed AOQ
- A complete statistical analysis of the quality process.
2.
3.
We formulate the set partitioning problem as a matching problem with simple side constraints. As a result we obtain a Lagrangian relaxation of the set partitioning problem in which the primal problem is a matching problem. To solve the Lagrangian dual we must solve a sequence of matching problems each with different edge-weights. We use the cyclic coordinate method to iterate the multipliers, which implies that successive matching problems differ in only two edge-weights. This enables us to use sensitivity analysis to modify one optimal matching to obtain the next one. We give theoretical and empirical comparisons of these dual bounds with the conventional linear programming ones. 相似文献
4.
An explicit steady state solution is determined for the distribution of the number of customers for a queueing system in which Poisson arrivals are bulks of random size. The number of customers per bulk varies randomly between 1 and m, m arbitrary, according to a point multinomial, and customer service is exponential. Queue characteristics are given. 相似文献
5.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
6.
7.
A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study. 相似文献
8.
This article addresses the problem of explicitly taking into account uncertainty about the demand for spare parts in making inventory procurement and stockage decisions. The model described provides for a unified treatment of the closely related problems of statistical estimation of demand and resource allocation within the inventory system, and leads to an easily implemented, efficient method of determining requirements for spare parts both in the early provisioning phase and in later periods of operations when demand data have accumulated Analyses of the model's theoretical foundations and of sample outcomes of the model based upon data on parts intended for use in the F-14 lead to conclusions of great importance to both support planners and operations planners Finally, of particular significance is the ability afforded the planner by this model to quantify the impact on inventory system costs of varying levels of system reliability or management uncertainty as to projected system performance. This will provide an economic basis for analysis of such alternatives as early deployment, operational testing, and equipment redesign. 相似文献
9.
Estimating the performance of an automatic target recognition (ATR) system in terms of its probability of successfully identifying a target involves extensive image collection and processing, which can be very time‐consuming and expensive. Therefore, we investigate the Wald sequential test for the difference in two proportions as a sample size‐reducing alternative to ranking and selection procedures and confidence intervals. An analysis of the test parameters leads to a practical methodology for implementing the Wald test for fairly comparing two systems, based on specific experimental goals. The test is also extended with the modified, sequentially rejective Bonferroni procedure for the multiple pairwise comparison of more than two systems. Two sampling schemes for different experimental goals are also discussed. The test methodology is applied to actual data to compare different configurations of a specific ATR system, with the results demonstrating that the modified Wald sequential procedure is a useful alternative to comparing proportions with confidence intervals, particularly when data are expensive. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 357–371, 1999 相似文献
10.
Kenneth R. Baker 《海军后勤学研究》1999,46(8):978-991
This paper examines heuristic solution procedures for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup times between different job families. It reviews the state of knowledge about the solution of this problem, which is known to be difficult to solve in general, and examines natural solution approaches derived from some of the underlying theory. The emphasis is on the design and computational evaluation of new heuristic procedures. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 978–991, 1999 相似文献