MC9242 RESOURCE MANAGEMENT TECHNIQUES SYLLABUS | ANNA UNIVERSITY MCA 4TH SEMESTER SYLLABUS REGULATION 2009 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY 4TH SEMESTER MCA MASTER OF COMPUTER APPLICATIONS DEPARTMENT SYLLABUS, TEXTBOOKS, REFERENCE BOOKS,EXAM PORTIONS,QUESTION BANK,PREVIOUS YEAR QUESTION PAPERS,MODEL QUESTION PAPERS, CLASS NOTES, IMPORTANT 2 MARKS, 8 MARKS, 16 MARKS TOPICS. IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI, TIRUNELVELI, COIMBATORE) 2009 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009
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
16
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 / ∞ /∞), (M /
M / 1) : (FIFO / N / ∞), (M / M / C) : (FIFO / ∞ / ∞), (M / M / C) : (FIFO / N / ∞) models.
TOTAL : 45 PERIODS
TEXT BOOK:
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.
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
16
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 / ∞ /∞), (M /
M / 1) : (FIFO / N / ∞), (M / M / C) : (FIFO / ∞ / ∞), (M / M / C) : (FIFO / N / ∞) models.
TOTAL : 45 PERIODS
TEXT BOOK:
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.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...