Abstract
The time minimising assignment problem is the problem of finding an assignment of n jobs to n facilities, one to each, which minimises the total time for completing all the jobs. The usual assumption made in these problems is that all the jobs are commenced simultaneously. In this paper two generalisations of this assumption are considered, and algorithms are presented to solve these general problems. Numerical examples are worked out illustrating the algorithms.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Seshan, C. Some Generalisations of the Time Minimising Assignment Problem. J Oper Res Soc 32, 489–494 (1981). https://doi.org/10.1057/jors.1981.99
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1981.99