Lot-size problems has drawn a great deal of attention in OR/Operations Management research literature. In their purest form, lot-size problems focus on the trade-off between set-up and inventory costs in generalized production environments. Single item lot-size problems are successfully treated through specialized Dynamic Programming algorithms [10, 12], while multi item problems prove harder t...

BACKGROUND Traditional Lot Quality Assurance Sampling (LQAS) designs assume observations are collected using simple random sampling. Alternatively, randomly sampling clusters of observations and then individuals within clusters reduces costs but decreases the precision of the classifications. In this paper, we develop a general framework for designing the cluster(C)-LQAS system and illustrate t...

Improved Formulations, Heuristics and Metaheuristics for the Dynamic Demand Coordinated Lot-sizing Problem. (August 2006) Arunachalam Narayanan, B.E., Anna University, India; M.S., Texas A&M University Chair of Advisory Committee: Dr. E. Powell Robinson Coordinated lot sizing problems, which assume a joint setup is shared by a product family, are commonly encountered in supply chain contexts. T...