Evaluation of a Modified Optimal Regions Alogorithm for Manpower Systems Experiments

摘要

The Brogden-Weaver optimal regions algorithms was programmed in U.S. ARPO for both a 12K IBM 1401 with tape transports and the much larger IBM 7094 computer system at the National Bureau of Standards. The 1401 version would achieve a near-optimal solution for a 3,000-by-75 matrix in a little more than 2 hours and, using more time, could solve a problem of twice that size--6,000 by 150. The Brodgen-Weaver algorithm rapidly proceeds to a near-optimal feasible solution which from 95 to 99 percent of the assignees are optimally allocated and the remaining placed in jobs that are near optimal for these persons--jobs for which their performance scores are within a score interval of their highest adjusted score. However, this efficiency was accomplished using a range between two integers instead of a single integer to express the constraints (i.e., job quotas). Under this modification, the number that must be assigned to job X might be designated as any integer between 100 and 106 rather than as exactly 103. Ranges instead of single numbers were used only where actual management requirements were approximations in the first place, or where flexibility with respect to the number that would be acceptable was present.