Please use this identifier to cite or link to this item: http://ir.library.ui.edu.ng/handle/123456789/1797
Full metadata record
DC FieldValueLanguage
dc.contributor.authorOdior, A. O.-
dc.contributor.authorOyawale, F. A.-
dc.date.accessioned2018-10-10T14:48:11Z-
dc.date.available2018-10-10T14:48:11Z-
dc.date.issued2010-11-
dc.identifier.issn1116-4336-
dc.identifier.otherJournal of the Nigerian Association of Mathematical Physics 17, pp. 371-376-
dc.identifier.otherui_art_odior_assignment_2010-
dc.identifier.urihttp://ir.library.ui.edu.ng/handle/123456789/1797-
dc.description.abstractThe assignment problem is a special type of linear programming problem which is concerned with allocating in operators (men) to n machines (tasks) given that each operator is qualified for certain of the tasks. The output from each task is given as a function of the number of qualified men assigned to it. The assignment model is to be solved by conventional linear programming approach or transportation model approach. It is a square matrix, having equal number of rows and columns. It enables the assignment of men to task and the objective is to assign one man from row to one task from column so as to maximize total output and minimize the total cost.en_US
dc.language.isoenen_US
dc.publisherNigerian Assocation of Mathematical Physicsen_US
dc.subjectAssignment Problemen_US
dc.subjectLinear Programmingen_US
dc.subjectOperators. Tasken_US
dc.subjectTotal Costen_US
dc.titleAn assignment problem for n machines and m operatorsen_US
dc.typeArticleen_US
Appears in Collections:scholarly works

Files in This Item:
File Description SizeFormat 
15.ui_art_odior_assignment_2010 (52).pdf4.83 MBAdobe PDFThumbnail
View/Open


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