|
||||
|
||||
Inventory Models with Alternative Delivery Lead Times, Demand Backlogging, and Priority RulesHaifeng WangTsinghua University - Department of Automation; The Chinese University of Hong Kong - Department of Systems Engineering & Engineering Management Houmin YanChinese University of Hong Kong (CUHK) - Department of Systems Engineering & Engineering Management Suresh SethiUniversity of Texas at Dallas - Naveen Jindal School of Management December 28, 2009 Abstract: A supplier provides several lead-time options to its customers in a periodic review inventory system. The replenishment lead time is a multiple of the inventory review cycle. Customers are classified into two groups: short lead-time customers requiring the product immediately and long lead-time customers to whom the supplier may deliver immediately or in the next cycle. We consider an inventory-commitment problem, in which the supplier allocates its on-hand inventory to these two groups of customers. When inventory runs out, the supplier backlogs orders to future cycles. Therefore, the supplier faces two problems: how the on-hand inventories are allocated between the two classes of customers and how the backlogged orders are cleared when replenishments arrive? We treat the former as an inventory-commitment problem and handle the latter with priority rules. We solve the former by dynamic programming and use three priority rules in clearing backlogs. We also explore the optimal inventory replenishment issue and evaluate the performance of each priority rule.
Number of Pages in PDF File: 40 Keywords: Inventory Models, Lead times, backloggging, priority rules, customer classes, FCFS, make-to stock, make-to-order, two critical number policies JEL Classification: C61, M11 working papers seriesDate posted: February 6, 2009 ; Last revised: May 23, 2012Suggested CitationContact Information
|
|
|||||||||||||||||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo1 in 0.375 seconds