首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
This article considers the problem of production control and stock rationing in a make-to-stock production system with two priority customer classes and backordering. The problem is formulated as a queueing control model. With Poisson arrivals and exponential production times, we show that the optimal production control and stock-rationing policies can be characterized by a single, monotone switching curve. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44 : 457–472, 1997  相似文献   

2.
Traditional inventory systems treat all demands of a given item equally. This approach is optimal if the penalty costs of all customers are the same, but it is not optimal if the penalty costs are different for different customer classes. Then, demands of customers with high penalty costs must be filled before demands of customers with low penalty costs. A commonly used inventory policy for dealing with demands with different penalty costs is the critical level inventory policy. Under this policy demands with low penalty costs are filled as long as inventory is above a certain critical level. If the inventory reaches the critical level, only demands with high penalty costs are filled and demands with low penalty costs are backordered. In this article, we consider a critical level policy for a periodic review inventory system with two demand classes. Because traditional approaches cannot be used to find the optimal parameters of the policy, we use a multidimensional Markov chain to model the inventory system. We use a sample path approach to prove several properties of this inventory system. Although the cost function is not convex, we can build on these properties to develop an optimization approach that finds the optimal solution. We also present some numerical results. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   

3.
This article studies a firm that procures a product from a supplier. The quality of each product unit is measured by a continuous variable that follows a normal distribution and is correlated within a batch. The firm conducts an inspection and pays the supplier only if the product batch passes the inspection. The inspection not only serves the purpose of preventing a bad batch from reaching customers but also offers the supplier an incentive to improve product quality. The firm determines the acceptance sampling plan, and the supplier determines the quality effort level in either a simultaneous game or a Stackelberg leadership game, in which both parties share inspection cost and recall loss caused by low product quality. In the simultaneous game, we identify the Nash equilibrium form, provide sufficient conditions that guarantee the existence of a pure strategy Nash equilibrium, and find parameter settings under which the decentralized and centralized supply chains achieve the same outcome. By numerical experiments, we show that the firm's acceptance sampling plan and the supplier's quality effort level are sensitive to both the recall loss sharing ratio and the game format (i.e., the precommitment assumption of the inspection policy). © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013  相似文献   

4.
This paper considers the problem of computing optimal ordering policies for a product that has a life of exactly two periods when demand is random. Initially costs are charged against runouts (stockouts) and outdating (perishing). By charging outdating costs according to the expected amount of outdating one period into the future, a feasible one period model is constructed. The central theorem deals with the n-stage dynamic problem and demonstrates the appropriate cost functions are convex in the decision variable and also provides bounds on certain derivatives. The model is then generalized to include ordering and holding costs. The paper is concluded with a discussion of the infinite horizon problem.  相似文献   

5.
We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   

6.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network.  相似文献   

7.
The operating characteristics of (s,S) inventory systems are often difficult to compute, making systems analysis a tedious and often expensive undertaking. Approximate expressions for operating characteristics are presented with a view towards simplified analysis of systems behavior. The operating characteristics under consideration are the expected values of: total cost per period, period-end inventory, period-end stockout quantity, replenishment cost per period, and backlog frequency. The approximations are obtained by a two step procedure. First, exact expressions for the operating characteristics are approximated by simplified functions. Then the approximations are used to design regression models which are fitted to the operating characteristics of a large number of inventory items with diverse parameter settings. Accuracy to within a few percent of actual values is typical for most of the approximations.  相似文献   

8.
有容量限制的运输问题   总被引:3,自引:0,他引:3  
具有容量限制的运输问题可以用有界变量的线性规划问题求解,但是问题的规模往往变得很大,给求解带来不便。本文给出求解这一问题的表上作业法。  相似文献   

9.
In this article we have generalized previous models on multiechelon recoverable inventory systems to cover the cases of batch ordering and shipment policy, and when items can either be repaired or condemned. The batch ordering and shipment policy is appropriate when the setup cost for shipment and order and/or the demand rates of the items are relatively high. The operating characteristics of such a system have been studied. Specifically, the probability distribution of backorder levels at the bases are analyzed for different repair-time distributions. An approximation scheme is proposed for this distribution, and is evaluated using extensive simulation results. The results indicate that the scheme is very effective in providing near-optimal stocking levels in such a system.  相似文献   

10.
This paper analyzes the problem faced by a field commander who, confronted by an enemy on N battlefields, must determine an interdiction policy for the enemy's logistics system which minimizes the amount of war material flowing through this system per unit time. The resource utilized to achieve this interdiction is subject to constraint. It can be shown that this problem is equivalent to determining the set of arcs Z* to remove subject to constraint from a directed graph G such that the resulting maximal flow is minimized. A branch and bound algorithm for the solution to this problem is described, and a numerical example is provided.  相似文献   

11.
Consider a threshold control policy for an imperfect production system with only a work center handling both regular and rework jobs. An imperfect production system studied here, generates defect jobs by factors other than machine failures. A threshold control or (ω, s) policy sets the guideline for a work center to switch between regular and rework jobs. A production cycle begins with loading and processing of several batches of regular jobs with a lot size equal to s. The outcome of each completed regular job is an independent Bernoulli trial with three possibilities: good, rework, or scrap. Once the work center accumulates more than a threshold ω of rework jobs, it finishes the last batch of regular jobs and switches to rework jobs. The objective of this research is to find a threshold ω and a lot size s that maximize the average long‐term profit. The ultimate goal is to construct a simple algorithm to search for ω and s that can be implemented directly in production management systems, as a result of this work. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 273–301, 1999  相似文献   

12.
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.  相似文献   

13.
We consider stochastic scheduling models which have the natural character that jobs improve while being processed, but deteriorate (and may possibly leave the system altogether) while processing is diverted elsewhere. Such restless bandit problems are shown to be indexable in the sense of Whittle. A numerical study which elucidates the strong performance of the resulting index policy is complemented by a theoretical study which demonstrates the optimality of the index policy under given conditions and which develops performance guarantees for the index heuristic more generally. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 706–721, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10036  相似文献   

14.
Canada is now at a crossroads unlike any other period in its history and needs to carefully consider which path to take. With the new Trudeau government comfortably ensconced since the defeat of the Harper government in the fall of 2015, a variety of competing interests have emerged in an attempt to turn Canadian policy back to a more nostalgic period of the 1970s that some see as preferable to the institutional lash-up that existed since the rolling out of the Canada First policy in the 2000s. That nostalgic period is, however, misunderstood both willfully for political purposes but also through a lack of historical context. Firmly rooting future actions in a blunt analysis of national interests is preferable to the alternative.  相似文献   

15.
A general multiperiod multi-echelon supply system consisting of n facilities each stocking a single product is studied. At the beginning of a period each facility may order stock from an exogenous source with no delivery lag and proportional ordering costs. During the period the (random) demands at the facilities are satisfied according to a given supply policy that determines to what extent stock may be redistributed from facilities with excess stock to those experiencing shortages. There are storage, shortage, and transportation costs. An ordering policy that minimizes expected costs is sought. If the initial stock is sufficiently small and certain other conditions are fulfilled, it is optimal to order up to a certain base stock level at each facility. The special supply policy in which each facility except facility 1 passes its shortages on to a given lower numbered facility called its direct supplier is examined in some detail. Bounds on the base stock levels are obtained. It is also shown that if the demand distribution at facility j is stochastically smaller (“spread” less) than that at another facility k having the same direct supplier and if certain other conditions are fulfilled, then the optimal base stock level (“virtual” stock out probability) at j is less than (greater than) or equal to that at facility k.  相似文献   

16.
随着装备结构日益复杂和装备性能日益提升,可靠性等通用质量特性在装备的全寿命周期内发挥的作用也日益增加。本文从通用质量特性要求论证、研制生产阶段监督评价和使用保障阶段管理等三个方面分析了军用飞机通用质量管理的工作现状,剖析了存在问题,提出对策建议,为军用飞机的通用质量特性管理和在役考核等工作的进一步发展提供了思路。  相似文献   

17.
This note studies the optimal inspection policies in a supply chain in which a manufacturer purchases components from a supplier but has no direct control of component quality. The manufacturer uses an inspection policy and a damage cost sharing contract to encourage the supplier to improve the component quality. We find that all‐or‐none inspection policies are optimal for the manufacturer if the supplier's share of the damage cost is larger than a threshold; otherwise, the manufacturer should inspect a fraction of a batch. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   

18.
In this article, an optimal replacement policy for a cold standby repairable system consisting of two dissimilar components with repair priority is studied. Assume that both Components 1 and 2, after repair, are not as good as new, and the main component (Component 1) has repair priority. Both the sequence of working times and that of the components'repair times are generated by geometric processes. We consider a bivariate replacement policy (T,N) in which the system is replaced when either cumulative working time of Component 1 reaches T, or the number of failures of Component 1 reaches N, whichever occurs first. The problem is to determine the optimal replacement policy (T,N)* such that the long run average loss per unit time (or simply the average loss rate) of the system is minimized. An explicit expression of this rate is derived, and then optimal policy (T,N)* can be numerically determined through a two‐dimensional‐search procedure. A numerical example is given to illustrate the model's applicability and procedure, and to illustrate some properties of the optimal solution. We also show that if replacements are made solely on the basis of the number of failures N, or solely on the basis of the cumulative working time T, the former class of policies performs better than the latter, albeit only under some mild conditions. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010  相似文献   

19.
炸高对聚能射流的侵彻作用影响很大,尤其在大炸高的情况下,射流很容易出现断裂和径向分散,其侵彻能力将显著降低。通过对射流形成、运动和侵彻过程的分析,得出了比较合理的防护墙抗金属射流的安全防护距离,可以为防护工程的设计提供参考。  相似文献   

20.
The model for a modified block replacement policy (MBRP) is extended to include running costs. An illustrative example is worked out for the case when item life is exponentially distributed and marginal running cost per unit time increases linearly with the age of the item.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号