The staff scheduling problem in the retail business is considered for which a new mathematical model and new solution methods are introduced. The problem is formalized as a set covering type problem. Columns represent feasible weekly working time patterns of one sales clerk. Rows correspond to...

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 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...

A new model is presented for capacitated lot-sizing with sequence dependent setup costs. The model is solved heuristically with a backward oriented method; the sequence and lot-size decisions are based on a priority rule which consists of a convex combination of setup and holding costs. A...