The minimum shift design problem and its relation to the minimum edge-cost flow problem

@inproceedings{Kortsarz2001TheMS,
  title={The minimum shift design problem and its relation to the minimum edge-cost flow problem},
  author={Guy Kortsarz and Wolfgang Slany},
  year={2001}
}
We study the minimum shift design problem (MSD) that arose in a commercial shift scheduling software project: Given a collection of shifts and workforce requirements for a certain time interval, we look for a minimum cardinality subset of the shifts together with an optimal assignment of workers to this subset of shifts such that the deviation from the requirements is minimum. This problem is closely related to the minimum edge-cost flow problem (MECF ), a network flow variant that has many… CONTINUE READING