Manpower Allocation and Mathematical Programming.

by E. P. Durbin

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback14 pages $20.00 $16.00 20% Web Discount

The advent of large-capacity computer systems with remote terminal systems and access to actual manpower and personnel data should increase the use of mathematical programming techniques in dealing with manpower allocation problems. Such problems appear to involve a natural decomposition by specialty, or by groups of specialties, which should lead to computationally feasible problems. Even if a problem is excessively large, a combination of heuristic and formal analysis usually should be able to reduce it to tractable size. In this study a model is presented for solving the "rotation base requirement" problem, which involves specifying the number of military personnel in each grade, Air Force specialty code, and skill level required in the United States to support overseas military requirements. Some generalizations of the rotation situation are described that lead to familiar and pervasive manpower and personnel problems. 14 pp.

This report is part of the RAND Corporation paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.