Advertisement

Optimal Algorithms for the Economic Lot-Sizing Problem with Multi-supplier

  • Qing-Guo Bai
  • Jian-Teng Xu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6124)

Abstract

This paper considers the economic lot-sizing problem with multi-supplier in which the retailer may replenish his inventory from several suppliers. Each supplier is characterized by one of two types of order cost structures: incremental quantity discount cost structure and multiple set-ups cost structure. The problem is challenging due to the mix of different cost structures. By analyzing the optimal properties, we reduce the searching range of the optimal solutions and develop several optimal algorithms to solve all cases of this multi-supplier problem.

Keywords

Economic lot-sizing optimal algorithm dynamic programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wagner, H.M., Whitin, T.: Dynamic Version of the Economic Lot Size Model. Manage. Sci. 14, 429–450 (1958)MathSciNetGoogle Scholar
  2. 2.
    Federgruen, A., Lee, C.Y.: The Dynamic Lot Size Model with Quantity Discount. Nav. Res. Logist. 37, 707–713 (1990)zbMATHCrossRefGoogle Scholar
  3. 3.
    Xu, J., Lu, L.L.: The Dynamic Lot Size Model with Quantity Discount: Counterexample and Correction. Nav. Res. Logist. 45, 419–422 (1998)zbMATHCrossRefGoogle Scholar
  4. 4.
    Zhang, Y.Z., Xu, J.T., Bai, Q.G.: Dynamic Lot-Sizing Model with a Class of Multi- Breakpoint Discount Cost Structures. In: The Sixth International Symposium on Operations Research and Its Applications, pp. 264–269. World Publishing Corporation, China (2006)Google Scholar
  5. 5.
    Chu, L.Y., Hsu, V.H., Shen, Z.J.: An Economic Lot Sizing Problem with Perishable Inventory and Economic of Scale Costs: Approximation Solution and Worst Case Analysis. Nav. Res. Logist. 52, 536–548 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Lee, C.Y.: Inventory Replenishment Model: Lot Sizing Versus Just-In-Time. Oper. Res. Lett. 32, 581–590 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Li, C.L., Hsu, V.N., Xiao, W.Q.: Dynamic Lot Sizing with Batch Ordering and Truckload Discounts. Oper. Res. 52, 639–654 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Solyal, O., Süral, H.: A Single SupplierCSingle Retailer System with an Order-Up-To Level Inventory Policy. Oper. Res. Lett. 36, 543–546 (2008)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Atamtürk, A., Küçükyavuz, S.: An O(n 2) Algorithm for Lot Sizing with Inventory Bounds and Fixed Costs. Oper. Res. Lett. 36, 297–299 (2008)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Jaruphongsa, W., Çetinkaya, S., Lee, C.Y.: A Dynamic Lot-Sizing Model with Multi-Mode Replenishments: Polynomial Algorithms for Special Cases with Dual and Multiple Modes. IIE Trans. 37, 453–467 (2005)CrossRefGoogle Scholar
  11. 11.
    Basnet, C., Leung, J.M.Y.: Inventory lot-sizing with supplier selection. Comput. Oper. Res. 32, 1–14 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Ekşioǧlu, S.D.: A Primal-Dual Algorithm for the Economic Lot-Sizing Problem with Multi-Mode Replenishment. Eur. J. Oper. Res. 197, 93–101 (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Qing-Guo Bai
    • 1
  • Jian-Teng Xu
    • 2
  1. 1.School of Operations Research and Management SciencesQufu Normal UniversityRizhaoChina
  2. 2.School of ManagementHarbin Institute of TechnologyHarbinChina

Personalised recommendations