| dc.contributor.author |
Khan J H |
en_US |
| dc.contributor.author |
Hafeez A |
en_US |
| dc.date.accessioned |
2017-01-30T08:16:04Z |
|
| dc.date.available |
2017-01-30T08:16:04Z |
|
| dc.identifier.uri |
http://hdl.handle.net/123456789/175629 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/1/377 |
|
| dc.description.abstract |
This case presents a special type of linear programming problem in which 'n' items are to be assigned among 'n' receivers, one item to a receiver, such that the total return resulting from the assignment is optimized. The question is how should the tasks be allocated to each person in order to minimize the total person-hours? |
en_US |
| dc.publisher |
NO |
en_US |
| dc.subject |
Computer |
|
| dc.subject.classification |
Quantitative Methods |
en_US |
| dc.subject.other |
Linear programming |
en_US |
| dc.subject.other |
quantitative analysis |
en_US |
| dc.subject.other |
production scheduling |
en_US |
| dc.title |
A NOTE ON SOLVING THE ASSIGNMENT PROBLEM BY MICROCOMPUTER |
en_US |
| dc.type |
06-068-86-2 |
en_US |
| dc.location |
case research chentre |
en_US |