The well-known Capacitated Lot-Sizing Problem (CLSP) is based on the assumption that for each lot in a period setup costs are incurred. The setup costs of a CLSP solution can be reduced by linking the production quantities of an item which is scheduled in two adjacent periods. Therefore we...

The sales force deployment problem is considered which arises in many selling organizations. As a solution a novel mixed-integer formulation is introduced which is specifically characterized by an infinite number of variables. A column generation approach is proposed to obtain upper and lower...

The sales force deployment problem is considered which arises in many selling organizations. As a solution a novel mixed-integer formulation is introduced which is specifically characterized by an infinite number of variables. A column generation approach is proposed to obtain upper and lower...

This paper deals with lot sizing and scheduling for a single-stage production System where setup costs and times are sequence dependent. A large bücket mixed integer programming (MIP) model is formulated which considers only efficient sequences. A tailor-made enumeration method of the...