Loading...

An efficient optimal algorithm for the quantity discount problem in material requirement planning

Mirmohammadi, H ; Sharif University of Technology | 2009

669 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.cor.2008.05.003
  3. Publisher: 2009
  4. Abstract:
  5. An optimal algorithm based on branch-and-bound approach is presented in this paper to determine lot sizes for a single item in material requirement planning environments with deterministic time-phased demand and constant ordering cost with zero lead time, where all-units discounts are available from vendors and backlog is not permitted. On the basis of the proven properties of optimal order policy, a tree-search procedure is presented to construct the sequence of optimal orders. Some useful fathom rules have been proven, which make the algorithm very efficient. To compare the performance of this algorithm with the other existing optimal algorithms, an experimental design with various environments has been developed. Experimental results show that the performance of our optimal algorithm is much better than the performance of other existing optimal algorithms. Considering computational time as the performance measure, this algorithm is considered the best among the existing optimal algorithms for real problems with large dimensions (i.e. large number of periods and discount levels). © 2008 Elsevier Ltd. All rights reserved
  6. Keywords:
  7. Purchasing ; Uncertain systems ; All-units discount ; Branch and bound ; Branch and bounds ; Computational times ; Experimental designs ; Inventory ; Large dimensions ; Lead times ; Lot sizes ; Lot sizing ; Material Requirement Planning ; Optimal algorithms ; Ordering costs ; Performance measures ; Quantity discounts ; Real problems ; Search procedures ; Algorithms
  8. Source: Computers and Operations Research ; Volume 36, Issue 6 , 2009 , Pages 1780-1788 ; 03050548 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0305054808000981