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

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.