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 s...
Gespeichert in:
Veröffentlicht in: | The Journal of the Operational Research Society 1993-10, Vol.44 (10), p.973-981 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0160-5682 1476-9360 |
DOI: | 10.1057/jors.1993.166 |