Title: Promising orders in supply chain networks
Author: Uday Venkatadri, Shentao Wang, Ashish Saraswat
Department of Industrial Engineering, Dalhousie University, P.O. Box 1000, 5269 Morris Street, Halifax, Nova Scotia B3J 2X4, Canada.
LSI Logic Hong Kong Ltd., Hong Kong, China.
Centre for Supply Chain Management, School of Mechanical and Aerospace Engineering, Nanyang Technological University, 639798 Singapore
Abstract: We consider how orders may be promised in a supply chain network. Order promising is increasingly getting attention in both theory and practice due to the proliferation of automated ordering systems. In our model, customers request quotations for a given quantity of products on a due date. The question for a firm is what dates to promise in reply to requests-based on production plans and distribution plans and available capacity. The inputs represent production and distribution data, initial inventories, committed orders and customer due date requests. The outputs of our model are the production quantities in each period and the sourcing path for each product. We show the application of the model to quoting due dates, estimating marginal costs for requests and estimating the maximum availability of products in time periods. The model can be used by companies to promise orders in combination with existing Enterprise Resource Planning (ERP) software.
Keywords: supply chain management; SCM; make-to-order; MTO; order promising; available-to-promise; advanced ATP; capability-to-promise; CTP; AATP; enterprise resource planning; ERP.
Int. J. of Industrial and Systems Engineering, 2008 Vol.3, No.2, pp.211 - 228
Available online: 21 Jan 2008