Please use this identifier to cite or link to this item:
|Title:||An assignment problem for n machines and m operators|
|Authors:||Odior, A. O.|
Oyawale, F. A.
|Publisher:||Nigerian Assocation of Mathematical Physics|
|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.|
|Appears in Collections:||scholarly works|
Files in This Item:
|15.ui_art_odior_assignment_2010 (52).pdf||4.83 MB||Adobe PDF|
Items in UISpace are protected by copyright, with all rights reserved, unless otherwise indicated.