Two mixed integer programming formulations arising in manufacturing management

AbstractWe provide formulation techniques for obtaining sharp (i.e., convex hull) mixed integer programming (MIP) formulations for different classes of lot-sizing problems, including various backlogging models, and with the possibility of fixed charges on the production, backlogging, and inventory variables.We also explore approximation results for MIP formulations of generalized shop loading problems