共查询到20条相似文献,搜索用时 16 毫秒
1.
Military Standard 105D has been almost universally adopted by government and private consumers for the lot-by-lot sampling inspection of product which may be inspected on a dichotomoun basis The plan specifies, for each lot size, a random sample size and set of acceptance numbers (maximum allowable number of defectives in each sample). The acceptance numbers are based upon the binomial distribution and depend upon the quality required by the purchaser. Where several consecutive lots are submitted, a shift to less severe (“reduced”) inspection or more severe (“tightened”) inspection is specified when the ongoing quality is very high or low. Further experience permits a return to normal sampling from either of these states This paper examines the long range costs of such a sampling scheme. The three inspection types are considered as three distinct Markov chains, with periodic transitions from chain to chain. The expected sample size and the expected proportion of rejected product are determined as a function of the two parameters under control of the manufacturer, lot size and product quality. Some numerical examples are given which illustrate how to compute the overall cost of sampling inspection. Suggestions are made concerning the choice of parameters to minimize this cost. 相似文献
2.
This article deals with several items, including theoretical and applied results. Specific topics include (1) a discrete, economically based, attributes acceptance sampling model and its adaptations, (2) relevant costs, (3) relevant prior distributions, (4) comparison of single- and double-sampling results, and (5) reasons for marginal implementation success following excellent implementation efforts. The basic model used is one developed by Guthrie and Johns; adaptations include provisions for fixed costs as well as modifications to permit double sampling. Optimization is exact, rather than approximate. Costs incorporated into the model are for sampling inspection, lot acceptance, and lot rejection. For each of these three categories a fixed cost is included as well as two variable costs, one for each item and the other for each defective item. Discrete prior distributions for the number of defectives in a lot are used exclusively. These include the mixed binomial and Polya distributions. Single- and double-sampling results are compared. Double sampling regularly performs at only slightly lower cost per lot than single sampling. Also, some cost and prior distribution sensitivity results are presented. Comments are provided regarding actual implementation experiences in industry. Practical deficiencies with the Bayesian approach are described, and a recommendation for future research is offered. 相似文献
3.
We consider in this paper the coordinated replenishment dynamic lot‐sizing problem when quantity discounts are offered. In addition to the coordination required due to the presence of major and minor setup costs, a separate element of coordination made possible by the offer of quantity discounts needs to be considered as well. The mathematical programming formulation for the incremental discount version of the extended problem and a tighter reformulation of the problem based on variable redefinition are provided. These then serve as the basis for the development of a primal‐dual based approach that yields a strong lower bound for our problem. This lower bound is then used in a branch and bound scheme to find an optimal solution to the problem. Computational results for this optimal solution procedure are reported in the paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 686–695, 2000 相似文献
4.
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.
5.
The paper considers the economic lot scheduling problem (ELSP) where production facility is assumed to deteriorate, owing to aging, with an increasing failure rate. The time to shift from an “in‐control” state to an “out‐of‐control” state is assumed to be normally distributed. The system is scheduled to be inspected at the end of each production lot. If the process is found to be in an “out‐of‐control” state, then corrective maintenance is performed to restore it to an “in‐control” state before the start of the next production run. Otherwise, preventive maintenance is carried out to enhance system reliability. The ELSP is formulated under the capacity constraint taking into account the quality related cost due to possible production of non‐conforming items, process inspection, and maintenance costs. In order to find a feasible production schedule, both the common cycle and time‐varying lot sizes approaches are utilized. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 650–661, 2003 相似文献
6.
Albert Y. Ha 《海军后勤学研究》2001,48(1):41-64
We consider the problem of designing a contract to maximize the supplier's profit in a one‐supplier–one‐buyer relationship for a short‐life‐cycle product. Demand for the finished product is stochastic and price‐sensitive, and only its probability distribution is known when the supply contract is written. When the supplier has complete information on the marginal cost of the buyer, we show that several simple contracts can induce the buyer to choose order quantity that attains the single firm profit maximizing solution, resulting in the maximum possible profit for the supplier. When the marginal cost of the buyer is private information, we show that it is no longer possible to achieve the single firm solution. In this case, the optimal order quantity is always smaller while the optimal sale price of the finished product is higher than the single firm solution. The supplier's profit is lowered while that of the buyer is improved. Moreover, a buyer who has a lower marginal cost will extract more profit from the supplier. Under the optimal contract, the supplier employs a cutoff level policy on the buyer's marginal cost to determine whether the buyer should be induced to sign the contract. We characterize the optimal cutoff level and show how it depends on the parameters of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 41–64, 2001 相似文献
7.
针对径向基插值代理模型样本点预测误差为零时无法获得误差函数进行序列再采样优化的问题,将样本点分布约束引入序列再采样过程,利用潜在最优解加速收敛性,提出一种适用于径向基插值代理模型序列优化的再采样策略,该策略兼顾仿真模型的输出响应特性与样本点的空间分布特性。仿真结果表明,使用该再采样策略后,算法寻优效率和精度均优于传统基于代理模型的优化方法,在对最优解进行有效预测的同时,能显著减少原始模型计算次数。 相似文献
8.
This paper considers a warehouse sizing problem whose objective is to minimize the total cost of ordering, holding, and warehousing of inventory. Unlike typical economic lot sizing models, the warehousing cost structure examined here is not the simple unit rate type, but rather a more realistic step function of the warehouse space to be acquired. In the cases when only one type of stock‐keeping unit (SKU) is warehoused, or when multiple SKUs are warehoused, but, with separable inventory costs, closed form solutions are obtained for the optimal warehouse size. For the case of multi‐SKUs with joint inventory replenishment cost, a heuristic with a provable performance bound of 94% is provided. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 299–312, 2001 相似文献
9.
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 相似文献
10.
This paper presents a procedure akin to dynamic programming for designing optimal acceptance sampling plans for item-by-item inspection. Using a Bayesian procedure, a prior distribution is specified, and a suitable cost model is employed depicting the cost of sampling, accepting or rejecting the lot. An algorithm is supplied which is digital computer oriented. 相似文献
11.
A classical and important problem in stochastic inventory theory is to determine the order quantity (Q) and the reorder level (r) to minimize inventory holding and backorder costs subject to a service constraint that the fill rate, i.e., the fraction of demand satisfied by inventory in stock, is at least equal to a desired value. This problem is often hard to solve because the fill rate constraint is not convex in (Q, r) unless additional assumptions are made about the distribution of demand during the lead‐time. As a consequence, there are no known algorithms, other than exhaustive search, that are available for solving this problem in its full generality. Our paper derives the first known bounds to the fill‐rate constrained (Q, r) inventory problem. We derive upper and lower bounds for the optimal values of the order quantity and the reorder level for this problem that are independent of the distribution of demand during the lead time and its variance. We show that the classical economic order quantity is a lower bound on the optimal ordering quantity. We present an efficient solution procedure that exploits these bounds and has a guaranteed bound on the error. When the Lagrangian of the fill rate constraint is convex or when the fill rate constraint does not exist, our bounds can be used to enhance the efficiency of existing algorithms. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 635–656, 2000 相似文献
12.
S. Andrew Starbird 《海军后勤学研究》1997,44(6):515-530
Acceptance sampling is often used to monitor the quality of raw materials and components when product testing is destructive, time-consuming, or expensive. In this paper we consider the effect of a buyer-imposed acceptance sampling policy on the optimal batch size and optimal quality level delivered by an expected cost minimizing supplier. We define quality as the supplier's process capability, i.e., the probability that a unit conforms to all product specifications, and we assume that unit cost is an increasing function of the quality level. We also assume that the supplier faces a known and constant “pass-through” cost, i.e., a fixed cost per defective unit passed on to the buyer. We show that the acceptance sampling plan has a significant impact on the supplier's optimal quality level, and we derive the conditions under which zero defects (100% conformance) is the policy that minimizes the supplier's expected annual cost. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 515–530, 1997 相似文献
13.
Viliam Makis 《海军后勤学研究》1998,45(2):165-186
An EMQ model with a production process subject to random deterioration is considered. The process can be monitored through inspections, and both the lot size and the inspection schedule are subject to control. The “in-control” periods are assumed to be generally distributed and the inspections are imperfect, i.e., the true state of the process is not necessarily revealed through an inspection. The objective is the joint determination of the lot size and the inspection schedule, minimizing the long-run expected average cost per unit time. Both discrete and continuous cases are examined. A dynamic programming formulation is considered in the case where the inspections can be performed only at discrete times, which is typical for the parts industry. In the continuous case, an optimum inspection schedule is obtained for a given production time and given number of inspections by solving a nonlinear programming problem. A two-dimensional search procedure can be used to find the optimal policy. In the exponential case, the structure of the optimal inspection policy is established using Lagrange's method, and it is shown that the optimal inspection times can be found by solving a nonlinear equation. Numerical studies indicate that the optimal policy performs much better than the optimal policy with periodic inspections considered previously in the literature. The case of perfect inspections is discussed, and an extension of the results obtained previously in the literature is presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 165–186, 1998 相似文献
14.
Thomas J. Lorenzen 《海军后勤学研究》1985,32(1):57-69
This article considers a general method for acceptance/rejection decisions in lot-by-lot sampling situations. Given arbitrary cost functions for sampling, accepting, and rejecting (where the cost can depend on the quality of the item) and a prior distribution on supplier quality, formulas are derived that lead to the minimal cost single-staged inspection plan. For the Bernoulli case, where each item is classified as acceptable or defective, the formulas simplify immensely. A computer code for solving the Bernoulli case is given. 相似文献
15.
In the classical EPQ model with continuous and constant demand, holding and setup costs are minimized when the production rate is no larger than the demand rate. However, the situation may change when demand is lumpy. We consider a firm that produces multiple products, each having a unique lumpy demand pattern. The decision involves determining both the lot size for each product and the allocation of resources for production rate improvements among the products. We find that each product's optimal production policy will take on only one of two forms: either continuous production or lot‐for‐lot production. The problem is then formulated as a nonlinear nonsmooth knapsack problem among products determined to be candidates for resource allocation. A heuristic procedure is developed to determine allocation amounts. The procedure decomposes the problem into a mixed integer program and a nonlinear convex resource allocation problem. Numerical tests suggest that the heuristic performs very well on average compared to the optimal solution. Both the model and the heuristic procedure can be extended to allow the company to simultaneously alter both the production rates and the incoming demand lot sizes through quantity discounts. Extensions can also be made to address the case where a single investment increases the production rate of multiple products. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
16.
Quantile is an important quantity in reliability analysis, as it is related to the resistance level for defining failure events. This study develops a computationally efficient sampling method for estimating extreme quantiles using stochastic black box computer models. Importance sampling has been widely employed as a powerful variance reduction technique to reduce estimation uncertainty and improve computational efficiency in many reliability studies. However, when applied to quantile estimation, importance sampling faces challenges, because a good choice of the importance sampling density relies on information about the unknown quantile. We propose an adaptive method that refines the importance sampling density parameter toward the unknown target quantile value along the iterations. The proposed adaptive scheme allows us to use the simulation outcomes obtained in previous iterations for steering the simulation process to focus on important input areas. We prove some convergence properties of the proposed method and show that our approach can achieve variance reduction over crude Monte Carlo sampling. We demonstrate its estimation efficiency through numerical examples and wind turbine case study. 相似文献
17.
18.
针对径向基插值代理模型样本点预测误差为零时无法获得误差函数进行序列再采样优化的问题,将样本点分布约束引入序列再采样过程,利用潜在最优解加速收敛性,提出一种适用于径向基插值代理模型序列优化的再采样策略,该策略兼顾仿真模型的输出响应特性与样本点的空间分布特性。仿真结果表明,使用该在采样策略后,算法寻优效率和精度均优于传统基于代理模型的优化方法,在对最优解进行有效预测的同时,能显著减少原始模型计算次数。 相似文献
19.