• Title of article

    Solving single-producteconomiclot-sizingproblemwithnon-increasing setup cost,constantcapacityandconvexinventorycostin O(NlogN) time

  • Author/Authors

    Yi Feng ، نويسنده , , ShaoxiangChen، نويسنده , , ArunKumar c، نويسنده , , BingLin ، نويسنده ,

  • Issue Information
    ماهنامه با شماره پیاپی سال 2011
  • Pages
    6
  • From page
    717
  • To page
    722
  • Abstract
    This paperconsidersaneconomiclotsizingmodelwithconstantcapacity,non-increasingsetupcost, and convexinventorycostfunction.Algorithmswithcomputationaltimeof O(N TDN)havebeen developedforsolvingthemodel,where N is thenumberofplanningperiodsand TDN is thetotal demand.Thisstudypartiallycharacterizestheoptimalplanningstructureofthemodel.Anewefficient algorithmwithcomputationaltimeof O(Nlog N) hasalsobeendevelopedbasedonthepartialoptimal structure.Moreover,computationalstudydemonstratesthatthenewalgorithmisefficient.
  • Keywords
    Inventory , Dynamic programming , Stochastic programming , Algorithm complexity
  • Journal title
    Computers and Operations Research
  • Serial Year
    2011
  • Journal title
    Computers and Operations Research
  • Record number

    927896

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=927896