An Integer Programming Solution to a Capacity Planning Problem in an Armaments Factory

A production shop in Royal Ordnance contains machines which in many cases can be converted to manufacture any of the main products passing through the shop. The task of periodically reconfiguring the lines to match more nearly a given set of demands is a classic mathematical programming problem. A solution and some of its uses are presented as a case study.