首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Noori and Keller [1] recently proposed a lot-size reorder-point model in which the quantity received is a random variable. The authors failed, however, to explore the full implications of their initial definitions. This oversight leads to some misleading inferences that we try to correct in this note.  相似文献   

2.
The classical analysis of the economic order quantity (EOQ) problem ignores the effect of inflation. When a firm's cost factors are expected to rise at an annual rate of 10 percent or more, what adjustments in order quantities should the firm make to control its lot-size inventory (or cycle stock)? Using a model that includes both inflationary trends and time discounting, it is concluded that inflation brings no incentive either to increase or to decrease order quantities. In addition, order quantities can be computed using the classical EOQ formula under inflationary conditions, provided that the cost of capital invested in inventory is interpreted as an inflation-free cost. This interpretation implies that changes in the inflation rate should not affect the cost of capital that is utilized in the EOQ formula for determining order quantities.  相似文献   

3.
Joglekar and Tharthare [6] presented an alternate approach for minimizing total inventory carrying and ordering costs of a vendor and the purchaser(s). This approach permits the vendor and the purchaser(s) to rationally select their operating policies. Joglekar and Tharthare claimed that their approach is more economical than the joint lot-size approach. In this note we identify some conceptual issues in their approach and demonstrate the superiority of the joint lot-size approach with the help of an example.  相似文献   

4.
This note examines the sensitivity of the basic economic-order-quantity inventory model to lot-size errors when holding costs are assumed to be a strictly increasing (though not necessarily linear) function of average inventory. In particular, we show that the penalty associated with ordering either too much or too little is a function not only of the size of the error but of the shape of the holding-cost curve as well. We demonstrate that, under certain conditions, even relatively small lot-size errors can be extremely costly.  相似文献   

5.
Many American firms are implementing just-in-time production in order to minimize inventories, reduce flow time, and maximize resource utilization. These firms recognize that, in the short run, setup costs really are fixed expenses and it is available capacity which is the critical factor in determining production-run quantities. We propose using available capacity to increase the number of setups and reduce lot-size inventories. This results in improved relevant cost performance. Sugimori, Kusunoki, Cho, and Uchikawa [16] in their paper on the Toyota kanban system developed a relationship for lead time but failed to use it for lot sizing. We use this relationship to develop the joint lot-sizing rule. The efficacy of our proposed rule is demonstrated by applying it to lot-size scheduling problems at the John Deere Engine Works [14]. Extensions of the proposed rule to undercapacity situations with material-wastage costs in the setup processes and to multistate production inventory systems also are discussed.  相似文献   

6.
Moutaz Khouja 《决策科学》1996,27(3):589-599
Recent extensions of the newsboy problem have focused on multiple discounts used by retailers to sell excess inventory. Earlier extensions have focused on quantity discounts offered by suppliers. An important practical extension would address a combination of the two previous extensions. In this paper, a newsboy problem with supplier quantity discounts and retailer multiple discounts is formulated and solved. The case of all-units supplier quantity discounts is addressed, and the results with numerical examples are illustrated.  相似文献   

7.
Suresh Chand 《决策科学》1982,13(1):113-119
This paper presents a modification of the dynamic lot-size algorithm of Wagner and Whitin for rolling horizon environments. The computational results show that the modified algorithm gives better cost performance than the Wagner-Whitin algorithm and the Silver-Meal heuristic. The improvements over the Wagner-Whitin algorithm require very few additional computations.  相似文献   

8.
Several heuristic procedures for purchase lot sizing in material requirements planning (MRP) systems were tested with actual data from manufacturing companies. Information provided by the companies for each purchased item included the estimated requirements and costs, the price discount structure from the vendor, and the actual company ordering policy. Simulation tests for each purchased item involved comparisons of several purchase lot-size procedures from the research literature along with the actual procedure used by the company providing the data. Results indicate that one of the heuristic lot-size procedures from the literature consistently outperformed the company policies as well as all other models tested. Another noteworthy result is that, in some cases, the actual company order policy was more cost-effective than some of the models from the research literature.  相似文献   

9.
This paper analyzes the problem of choosing the optimal order quantity and its associated number of standard containers making up the order for single-period inventory models under standard container size discounts. A range is determined that contains the optimal order quantity. Two algorithms are presented. The first algorithm solves the general case in which there is no restriction on the types of containers included in an order. The second algorithm solves a more restricted policy that requires the buyer to accept the order with successively smaller container sizes.  相似文献   

10.
The use of price to influence a buyer's purchasing behavior and thus improve supply chain coordination has received considerable attention. The vendor and buyer are independent economic entities, each maximizing its own profit. We consider the case of a buyer with fixed annual demand, independent of cost. The vendor's objective is to set a price schedule that encourages the buyer to raise its order quantity, increasing the vendor's profits. We present a unified treatment of the problem, categorize different variations, and provide a common solution procedure for all cases.  相似文献   

11.
Due to their importance in industry and mathematical complexity, dynamic demand lot-sizing problems are frequently studied. In this article, we consider coordinated lot-size problems, their variants and exact and heuristic solutions approaches. The problem class provides a comprehensive approach for representing single and multiple items, coordinated and uncoordinated setup cost structures, and capacitated and uncapacitated problem characteristics. While efficient solution approaches have eluded researchers, recent advances in problem formulation and algorithms are enabling large-scale problems to be effectively solved. This paper updates a 1988 review of the coordinated lot-sizing problem and complements recent reviews on the single-item lot-sizing problem and the capacitated lot-sizing problem. It provides a state-of-the-art review of the research and future research projections. It is a starting point for anyone conducting research in the deterministic dynamic demand lot-sizing field.  相似文献   

12.
In many developing countries where supply is limited, a premium rather than a discounted price is paid for buying in larger amounts. In order for management science/operations research solutions to be relevant to developing economies, such realities need to be explicitly recognized and any decisions evaluated from that perspective. To illustrate this point, a typical inventory-purchasing problem is solved. In the process, formulae are developed that introduce simultaneous price and quantity sensitivity into the inventory equation. A systematic procedure is suggested to locate the optimal order quantity for a given schedule of discounts or premiums.  相似文献   

13.
研究了存在需求单向替代的两产品动态批量决策的最优预测时阈问题.构建了包含替代成本、生产转换成本和库存成本在内的成本最小化模型,分析得出在只存在3类再生点(Ⅰ类、Ⅱ类和Ⅲ类)情形下的再生点单调性特征.同时,设计出了多项式时间的前向动态规划算法.运用数值试验分析了最优预测时阈与生产转换成本、替代成本、需求特征(需求增长性和...  相似文献   

14.
In this article we address the optimal quantity discount design problem of a supplier in a two‐stage supply chain where the supplier and the buyer share annual demand information only. The supply chain faces a constant deterministic demand that is not price sensitive and operates with fixed setup costs in both stages. We show that the supplier can actually moderate a cost‐minimizing buyer to order in quantities different than the buyer's optimal order quantity in the traditional setting and develop a multi‐breakpoint quantity discount scheme that maximizes supplier's expected net savings. The proposed multi‐breakpoint discount scheme can be easily computed from the available information and, while also maximizing the supplier's net savings, is very effective in achieving high levels of supply chain coordination efficiency in the presence of limited information.  相似文献   

15.
In most of the research done on material requirements planning (MRP) systems it has been assumed that production and assembly operations incur no yield loss. This assumption has been dropped and performance of popular lot-size adjustment rules borrowed from the single-stage reject allowance problem has been tested in an MRP environment. Both the effect of the rules on the component inventory, and their ability to meet the master production schedule requirements have been analysed. An appropriate statistical design has been presented.  相似文献   

16.
The traditional quantity discount problem is analyzed from the perspective of game theory, including both noncooperative and cooperative models. For the noncooperative case, the Stackelberg equilibrium is derived. For the cooperative case, the Pareto Optimality criteria are used to find a group of optimal strategies. Both scenarios are illustrated through an example which quantifies the benefits resulting from cooperation between the buyer and the seller for game-theoretic solutions using geometric programming.  相似文献   

17.
We present a general model for multi-item production and inventory management problems that include a resource restriction. The decision variables in the model can take on a variety of interpretations, but will typically represent cycle times, production batch sizes, number of production runs, or order quantities for each item. We consider environments where item demand rates are approximately constant and performing an activity such as producing a batch of a product or placing an order results in the consumption of a scarceresource that is shared among the items. Some examples of shared resources include limited machine capacity, a restriction on the amount of money that can be tied up in stock, orlimited storage capacity. We focus on the case where the decision variables must be integer valued or selected from a discrete set of choices, such as when an integer number of production runs is desired for each item, or in order quantity problems where the items come in pack sizes containing more than one unit and, therefore, the order quantities must be an integer multiple of the pack sizes. We develop a heuristic and a branch and bound algorithm for solving the problem. The branch and bound algorithm includes reoptimization procedures and the heuristic to improve its performance. Computational testing indicates that the algorithms are effective for solving the general model.  相似文献   

18.
Russell and Krajewski presented an optimal purchase order quantity algorithm that considered the effect of the transportation rate structure for less-than-truckload (LTL) shipments. The authors applied the Russell and Krajewski algorithm to a variety of freight classes and lengths-of-haul. Anomalous cases were found in which the freight rate schedule, when used with the suggested algorithm, resulted in incorrect order size decisions. In this comment, the authors consider the impact of these anomalies on the optimal order quantity and associated total costs. A procedure is presented to adjust the Russell and Krajewski algorithm to arrive at the optimal purchase order quantity and the lowest total annual cost.  相似文献   

19.
Discounts are a primary marketing mechanism for inducing customers to increase the size of their purchases. Quantity discounts from suppliers and freight discounts from shippers are commonly encountered by organizations. This paper structures quantity and freight discounts into the order size decision in a deterministic economic order quantity system. Optimum lot-sizing algorithms are derived for the dual discount situations of all-units or incremental quantity discounts and all-weight or incremental freight discounts.  相似文献   

20.
We study single and multiperiod quantity flexibility contracts involving one demand forecast update in each period and a spot market. We obtain the optimal order quantity at the beginning of a period and order quantities on contract and from the spot market at the then prevailing price after the forecast revision and before the demand materialization. The amount that can be purchased on contract is bounded by a given flexibility limit. We discuss the impact of the forecast quality and the level of flexibility on the optimal decisions and managerial insights behind the results.  相似文献   

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

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