Solving Goal-Programming Manpower Models Using Advanced Network Codes

Abstract

This paper shows that a certain class of manpower systems that are often modelled using goal programming can also be modelled as capacitated transshipment problems. The goal programming structure can be preserved in most cases through careful definition of the flow-cost function and through the use of multiple arcs in the network. This latter feature is made practical through the use of advanced network codes, such as GNET, that are now available. Solution times and costs are significantly lower than those obtained with the original goal programming formulation through the use of generalized linear programming codes.