Time-cost tradeoff in a three dimensional assignment problem

An algorithm to investigate time-cost tradeoff in a three dimensional assignment problem is presented in this paper. The algorithm is obtained as a combination of a known algorithm to solve three dimensional cost minimzing assignment problem and a procedure of modifying the cost minimizing problem in the light of a prescribed upper limit for time. The algorithm enables to identify efficient tradeoff pairs and thereby arrive at an optimum assignment through tradeoff ratios. These efficient tradeoff pairs are shown to be non-inferior solutions of the related bicriteria assignment problem. A simple numerical example is also given to illustrate the developed algorithm.