| Article ID: | iaor1997312 |
| Country: | Netherlands |
| Volume: | 68 |
| Issue: | 3 |
| Start Page Number: | 422 |
| End Page Number: | 426 |
| Publication Date: | Aug 1993 |
| Journal: | European Journal of Operational Research |
| Authors: | Geetha S., Nair K.P.K. |
In this paper, a meaningful variant of the cost minimizing assignment problem with the objective of minimizing the total cost of assignment plus an additional ‘supervisory’ cost, which depends on the total time of completion of the project is formulated. An efficient method of finding an optimal solution to such a problem is presented with a numerical example to illustrate the same.