• DocumentCode
    2885800
  • Title

    Infinitesimal Dividing Method: Sole Supplier Inventory Cost Model with Random Lead Times

  • Author

    Ji, Peng-cheng ; Song, Shi-ji ; Wu, Cheng

  • Author_Institution
    Dept. of Autom., Tsinghua Univ., Beijing
  • fYear
    2006
  • fDate
    13-16 Aug. 2006
  • Firstpage
    225
  • Lastpage
    229
  • Abstract
    This paper considers the inventory model with random procurement lead time. Using infinitesimal dividing method, the exact (Q,r) inventory cost model of single supplier procurement is presented, which is proved equal to the traditional model. Main properties of the model are analyzed strictly. The convexity of the cost function per unit time is proved. Then the optimal solution can be easily obtained by applying the classical convex optimization methods. Finally, numerical examples are given to verify the main conclusions in this paper
  • Keywords
    convex programming; costing; inventory management; lead time reduction; convex optimization method; cost function; infinitesimal dividing method; random procurement lead time; supplier inventory cost model; Automation; Cost function; Cybernetics; Electronic mail; Food industry; Inventory management; Logistics; Machine learning; Optimization methods; Parallel processing; Procurement; Uncertainty; Inventory management; convex optimization; infinitesimal dividing method; random lead time;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Machine Learning and Cybernetics, 2006 International Conference on
  • Conference_Location
    Dalian, China
  • Print_ISBN
    1-4244-0061-9
  • Type

    conf

  • DOI
    10.1109/ICMLC.2006.258958
  • Filename
    4028063