Article ID: | iaor1988398 |
Country: | United Kingdom |
Volume: | 40 |
Issue: | 1 |
Start Page Number: | 97 |
End Page Number: | 101 |
Publication Date: | Jan 1989 |
Journal: | Journal of the Operational Research Society |
Authors: | Geetha S., Vartak M.N. |
Keywords: | programming: assignment |
Several variations of two-dimensional (workers×jobs) and three-dimensional (workers×jobs¸×machines) time- as well as cost-minimizing assignment problems, which arise owing to (i) precedence relations of some form among the jobs or (ii) capacity restrictions on workers/machines imposed by the requirement that the surplus resources have to be fully employed, have been considered in the literature. In this paper, an algorithm is presented for time-cost trade-off analysis which is applicable to any general pair of such constrained problems. The algorithm is also illustrated by a numerical example.