Unformatted text preview: easible Solution
Initial Basic Feasible Solution North West Corner Method
Least Cost Method
Vogel’s Approximation Method The solution is said to be feasible when one gets (m+n1) allotments. Assignment Problem
Assignment Problem It is a problem of assigning various people, machines and so on in such a way that the total cost involved is minimized or the total value is maximized. QUEUING THEORY Queuing Theory
Queuing Theory A flow of customers from finite/infinite population towards the service facility forms a queue due to lack of capacity to serve them all at a time. Input Server Output Measures
Measures Traffic intensity
Average system length
Average queue length
Average waiting time in queue
Average waiting time...
View Full Document
This note was uploaded on 02/13/2014 for the course QNM 225 taught by Professor Karenbergin during the Spring '13 term at Seneca.
- Spring '13