PSNA COLLEGE OF ENGINEERING AND TECHNOLOGY, DINDIGUL 624 622 DEPARTMENT OF MECHANICAL ENGINEERING LESSON PLAN Subject Name

e Subject code Name of the faculty Objective: Operation research Branch Year / Semester /Sec Faculty Code Mechanical Engineering IV B.E./VIII Semester / C Sec (Jan May 2014)

10122MEE51
Mr.G.Balaji

ME 47

The central objective of operation research is optimization, i.e. to do things best under the given circumstances. This general concept has great many application, for instance, in agricultural planning, biotechnology, data analysis, distribution of goods and resources, emergency and rescue operations, engineering system design, environmental management, financial planning, health care management, inventory control, manpower and resource allocation, manufacturing of goods, military operations, production process control, risk management, sequencing and scheduling of tasks, telecommunication, and traffic control.

Programme Outcomes (POs) a) Graduates will demonstrate the ability to design and conduct experiments, interpret and analyze data and report skills.

b) Graduates will demonstrate the ability to use the techniques, skills, and engineering tools necessary for practicing in mechanical engineering field.

Programme Educational Objectives Graduates will have a successful career in mechanical engineering or related fields in industry, academia and other organizations throughout the world where an engineering approach to problem solving and ability to independent learning is highly valued. Graduates will act as effective and contributing team members in a multidisciplinary team work environment with high ethical standards and with an understanding of the role of engineering in the economy and the environment.

Definition: Operation research is the art of giving bad answer to problems to which otherwise there would be worse answer

Theory Class: 10

Unit - I Text Book Sl. No 1. 2. 3 4 5. 6. Date

LINEAR MODEL

Target Hours

T1 - Panneerselvam, Operations Research Prentice Hall of India, 2010. T2 - Taha H.A, Operation Research, Pearson Education sixth edition, 2003
Period Reqd. 1 Topics to be Covered Ref. Book T1/T2 T1/T2 T1/T2 T1/T2 T1/T2 T1/T2 Actual Date of completion Remarks

The phases of OR Study formation of an L.P model Graphical solution Simplex algorithm. Artificial variables technique Big M method, two phase method

1
1

1 1 1

.7 8 9 10 Theory Class:

1 1 1 1

Duality in LPP Transportation problem-Least cost method Vogels approximation method MODI method Assignment problem

T1/T2 T1/T2 T1/T2 T1/T2

Unit - II Text Book Sl. No 1. 2. 3. 4. 5. 6. Theory Class: Date

NETWORK MODELS

Target Hours

08

T1 - Panneerselvam, Operations Research Prentice Hall of India, 2010. T2 - Taha H.A, Operation Research, Pearson Education sixth edition, 2003
Period Reqd. 1 1 1 2 2 1 Topics to be Covered Ref. Book. T1/T2 T1/T2 T1/T2 T1/T2 T1/T2 T1/T2 Actual Date of completion Remarks

Shortest route Minimal spanning tree Maximum flow models Project network CPM and PERT network Critical path scheduling

Unit - III Text Book Sl. No 1. 2. 3. 4. 5. Date

INVENTORY MODELS

Target Hours

09

T1 - Panneerselvam, Operations Research Prentice Hall of India, 2010. T2 - Taha H.A, Operation Research, Pearson Education sixth edition, 2003
Period Reqd. 1 1 2 3 2 Topics to be Covered Ref. Book T1/T2 T1/T2 T1/T2 T1/T2 T1/T2 Target Hours 09 Actual Date of completion Remarks

Types of inventory EOQ,ERL Deterministic inventory problem Price break stochastic inventory problems Selective inventory control techniques

REPLACEMENT MODELS
Unit - IV Text Book Sl. No 1. 2. 3. 4. 5. 6. Theory Class: Date

T1 - Panneerselvam, Operations Research Prentice Hall of India, 2010. T2 - Taha H.A, Operation Research, Pearson Education sixth edition, 2003
Period Reqd. 2 2 1 1 2 1 Topics to be Covered Ref. Book T1/T2 T1/T2 T1/T2 T1/T2 T1/T2 T1/T2 Actual Date of completion Remarks

Replacement of items that deteriorate with time Value of money changing with time not charging with time Optimum replacement policy Individual and group replacement. Sequencing problem: models with n jobs with 2 machines Problem with n jobs with 3 machines.

Unit - V Text Book Sl. No 1. 2. 3 4. 5. 6. 7. 8. Reference Book:

QUEUING THEORY

Target Hours

09

T1 - Panneerselvam, Operations Research Prentice Hall of India, 2010. T2 - Taha H.A, Operation Research, Pearson Education sixth edition, 2003
Period Reqd. 1 1 1 2 1 1 1 1 Actual Date Topics to be Covered Ref. Book T1/T2 T1/T2 T1/T2 T1/T2 T1/T2 T1/T2 T1/T2 T1/T2 of completion Remarks

Date

Queuing models Queuing systems and structures Notation parameter Single server and multi server models. Poisson input Exponential service Constant rate service Infinite population

T1 - Panneerselvam, Operations Research Prentice Hall of India, 2010. T2 - Taha H.A, Operation Research, Pearson Education sixth edition, 2003
Content Beyond Syllabus: 1) Non Linear Optimization 2) Un conventional Optimization

FACULTY IN-CHARGE

HOD / MECH