Loading...

A branch and bound algorithm for the dynamic quantity discount lot sizing

Mirmohammadi, S. H ; Sharif University of Technology | 2008

376 Viewed
  1. Type of Document: Article
  2. Publisher: 2008
  3. Abstract:
  4. This paper presents an optimal algorithm based on Branch and Bound approach for determining lot sizes for purchased component in Material Requirement Planning (MRP) environments with deterministic dynamic demand pattern and constant ordering cost with zero lead time, where all units discounts are available from vendors and shortage is not allowed. Based on the properties of an optimal order policy proven in the literature, a tree search procedure is designed to construct sequences of orders in the optimal policy. Some useful fathom rules have been proven to make the algorithm very efficient. Copyright©(2008) by Computers & Industrial Engineering
  5. Keywords:
  6. All-units discount ; Branch-and-bound algorithms ; Branch-and-bound approaches ; Fathom rule ; Inventory ; Lot size ; Material requirement planning ; Optimal ordering policy ; Branch and bound method ; Linear programming ; Algorithms
  7. Source: 38th International Conference on Computers and Industrial Engineering 2008 ; Volume 3 , 2008 , Pages 2996-3005 ; 9781627486828 (ISBN)
  8. URL: https://sciexplore.ir/Documents/Details/536-518-985-370