1. A system of solving supply chain campaign planning problems involving major and minor setups, comprising: a database that stores data describing a plurality of major product families, data describing a plurality of minor product families, data describing a campaignable resource, and data describing a planning horizon; a computer comprising a memory and a processor coupled with the database and configured to: execute a major campaign, comprising: for two or more of the plurality of major product families: obtaining a major productivity fraction of the campaignable resource for an operation associated with a major product family; aggregating the major productivity fractions of the campaignable resource for operations associated with the major product family over a time interval that comprises at least a portion of a major time period; and calculating a second moment for the major product family over a time interval that comprises at least a portion of the major time period; and fixing an optimal major product family of the two or more major product families to the major time period on the planning horizon, in association with the campaignable resource, based at least on the aggregated major productivity fractions and the calculated second moments of a plurality of the two or more major product families; and execute a minor campaign, comprising: for two or more minor product families associated with the optimal major product family, obtaining a minor productivity fraction of the campaignable resource for a minor product family over at least a portion of the major time period; and fixing an optimal minor product family from the two or more minor product families to a minor time period based at least on the minor productivity fraction.