DSpace
 

EPrints@IIT Delhi >
Faculty Research Publicatons  >
Mathematics >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/603

Full metadata record

DC FieldValueLanguage
dc.contributor.authorArora, Shalini-
dc.contributor.authorPuri, M C-
dc.date.accessioned2005-07-29T09:46:02Z-
dc.date.available2005-07-29T09:46:02Z-
dc.date.issued1998-
dc.identifier.citationEuropean Journal of Operational Research, 110(2), 314-325en
dc.identifier.urihttp://eprint.iitd.ac.in/dspace/handle/2074/603-
dc.description.abstractA 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.en
dc.format.extent325369 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoenen
dc.subjectImbalanced assignment problemen
dc.subjectTime minimizing assignment problemen
dc.subjectBottleneck assignment problemen
dc.titleA variant of time minimizing assignment problemen
dc.typeArticleen
Appears in Collections:Mathematics

Files in This Item:

File Description SizeFormat
aroravar1998.pdf317.74 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback