An assignment problem for n machines and m operators

Please use this identifier to cite or link to this item: http://ir.library.ui.edu.ng/handle/123456789/1797

Full metadata record

DC Field	Value	Language
dc.contributor.author	Odior, A. O.	-
dc.contributor.author	Oyawale, F. A.	-
dc.date.accessioned	2018-10-10T14:48:11Z	-
dc.date.available	2018-10-10T14:48:11Z	-
dc.date.issued	2010-11	-
dc.identifier.issn	1116-4336	-
dc.identifier.other	Journal of the Nigerian Association of Mathematical Physics 17, pp. 371-376	-
dc.identifier.other	ui_art_odior_assignment_2010	-
dc.identifier.uri	http://ir.library.ui.edu.ng/handle/123456789/1797	-
dc.description.abstract	The 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.iso	en	en_US
dc.publisher	Nigerian Assocation of Mathematical Physics	en_US
dc.subject	Assignment Problem	en_US
dc.subject	Linear Programming	en_US
dc.subject	Operators. Task	en_US
dc.subject	Total Cost	en_US
dc.title	An assignment problem for n machines and m operators	en_US
dc.type	Article	en_US
Appears in Collections:	scholarly works

Files in This Item:

File	Description	Size	Format
15.ui_art_odior_assignment_2010 (52).pdf		4.83 MB	Adobe PDF	View/Open

UISpace