Preview Industrial Engineering - Operations Research

Back

Introduction

Why study OR

01 - Scope of the course

LPP - Linear Programming Problems

02 -What are Optimization problems

03 - Mathematical formulation of LPP

04 - Steps for solving LPP

05 - LPP Formulation

06 - How to draw graphs

07 - Numerical based on Graphical method

08 - Shortcut slope method

09 - Binding constraints & special cases

10 - LPP Analytical (Simplex) method

11 - Numerical based on simplex method

Transportation Problems

12 - What are transportation problems

13 - Allocations

14 - North-West Corner rule or DENTZY's methods

15 - Vogel's approximation method (VAM)

16 - Numerical on transportation problems

Assignment Problems

17 - Understanding assignment problems

18 - Hungarian method or Flood technique

19 - Numerical on assignment problem

20 - Solving maximization transportation

Sequencing

21 - The appropriate order

22 - SPT - Shortest Processing Time

23 - EDD - Earliest Due Date

24 - n jobs in 2 machines

25 - Numerical on n jobs in 2 machines

Queuing Theory

26 - Mathematical study of queues

27 - Why is queuing theory important

28 - Kendall Notation

29 - Important formulae

30 - Numerical on queuing theory

PERT & CPM - Network Analysis

31 - Project, Activity & Event

32 - Rules for network diagram

33 - Types of network diagram

34 - How to make a network diagram

35 - Network analysis

36 - CPM - Critical Path Methods

37 - Computational approach of CPM

38 - PERT - Program Evaluation Review Tech

39 - Numerical on PERT analysis

Preview - Industrial Engineering - Operations Research