MC9242 RESOURCE MANAGEMENT TECHNIQUES
L T P C
3 0 0 3
UNIT I LINEAR PROGRAMMING MODELS 9
Mathematical
Formulation - Graphical Solution of linear programming models – Simplex
method – Artificial variable Techniques- Variants of Simplex method
UNIT II TRANSPORTATION AND ASSIGNMENT MODELS 9
Mathematical
formulation of transportation problem- Methods for finding initial
basic feasible solution – optimum solution - degeneracy – Mathematical formulation of assignment models – Hungarian Algorithm – Variants of the Assignment problem
UNIT III INTEGER PROGRAMMING MODELS 9
Formulation – Gomory’s IPP method – Gomory’s mixed integer method – Branch and bound technique.
UNIT IV SCHEDULING BY PERT AND CPM 9
Network Construction – Critical Path Method – Project Evaluation and Review Technique – Resource Analysis in Network Scheduling
UNIT V QUEUEING MODELS 9
Characteristics of Queuing Models – Poisson Queues - (M / M / 1) : (FIFO / 8 /8), (M / M / 1) : (FIFO / N / 8), (M / M / C) : (FIFO / 8 / 8), (M / M / C) : (FIFO / N / 8) models.
Total No. of Periods : 45
TEXT BOOKS
1. Taha H.A., “Operations Research : An Introduction “ 7th Edition, Pearson Education,
2004.
REFERENCES
1. A.M.Natarajan, P.Balasubramani, A.Tamilarasi, “Operations Research”, Pearson
Education, Asia, 2005.
2. Prem Kumar Gupta, D.S. Hira, “Operations Research”, S.Chand & Company Ltd,
New Delhi, 3rd Edition , 2003.
Comments