Heuristics for Dynamic Lot-Sizing with Plan Setup Cost in a Rolling Horizon Environment

Researches of dynamic lot-sizing problem in a rolling horizon environment have not considered plan setup cost occurring when a plan is issued. This research deals with the dynamic single-level lot-sizing problem with plan setup cost and proposes heuristics for restricted forecast of demands beyond the planning horizon. Moreover, we provide test results to compare proposed heuristics with existing lot-sizing algorithms.