|
EPrints@IIT Delhi >
Faculty Research Publicatons >
Mathematics >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2074/603
|
| Title: | A variant of time minimizing assignment problem |
| Authors: | Arora, Shalini
Puri, M C |
| Keywords: | Imbalanced assignment problem
Time minimizing assignment problem
Bottleneck assignment problem |
| Issue Date: | 1998 |
| Citation: | European Journal of Operational Research, 110(2), 314-325 |
| Abstract: | 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 than one job, he does them one after the other in any order. The aim of the present study is to find that feasible assignment which minimizes the total time for completin all the jobs.A lexi-search
approach is proposed to find an optimal feasible assignment. |
| URI: | http://eprint.iitd.ac.in/dspace/handle/2074/603 |
| Appears in Collections: | Mathematics
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| aroravar1998.pdf | | 317Kb | Adobe PDF | View/Open |
|
Show full item record
All items in DSpace are protected by copyright, with all rights reserved.
|
