In this paper we consider a labor constrained scheduling problem (LCSP) which is a simplification of a practical problem arising in industry. Jobs are subject to precedence constraints and have specified processing times. Moreover, for each job the labor requirements varies as the job is...

We study the polyhedral structure of variants of the discrete lot-sizing problem viewed as special cases of convex integer programs. Our approach in studying convex integer programs is to develop results for simple mixed integer sets that can be used to model integer convex objective functions....