A variant of time minimizing assignment
β
Shalini Arora; M.C. Puri
π
Article
π
1998
π
Elsevier Science
π
English
β 720 KB
A time minimizing assignment problem (TMAP) dealing with the allocation ofn jobs to m(< n) persons is considered in this paper. One job is to be allocated to exactly one person and each person does at least one job. All the persons start working on the jobs simultaneously. If a person is to do more