Variants of the time minimization assignment problem

Abstract

The present paper develops techniques to solve two variants of the time minimizing assignment problem. In the first, there aren jobs to be assigned tom establishmets (m<n) in such a way that the time taken to complete all the jobs is the minimum, it being assumed that all the jobs are commenced simultaneously. The second variant is an extension of the first one in the sense that an additional constraint on the minimum number of jobs to be taken up by each establishment is introduced. Numerical examples are included to illustrate the techniques.