Being one of the most most prominent subject in mechanical / manufacturing / industrial engineering curriculum, this subject has very much weightage in every aspect. Be it for academic proficiency, acing competitive exams or cracking that tough interview, OR (Operations Research) plays a very significant role.
In professional front, the field of operations research provides a more powerful approach to decision making than ordinary software and data analytics tools. Employing operations research, professionals can help companies achieve more complete datasets, consider all available options, predict all possible outcomes and estimate risk. Additionally, operations research can be tailored to specific business processes or use cases to determine which techniques are most appropriate to solve the problem.
The ultimate aim of all the tools & practices involved in OR is to "Optimize".
In this course we are going to get the knowledge of various tools & practices of operations research with an ultimate aim to optimize problems & increase productivity. The course is divided into several sections, Linear Programming Problems, Transportation Problems, Assignment Problems, Sequencing, Queuing Theory & lastly PERT & CPM.
Linear Programming Problems (LPP) - In LPP, we will understand how to optimize a problem by using various methods like graphical method, slope method & simplex method. We will also understand about binding constraints & certain special cases.
Transportation & Assignment Problems - In transportation, we will understand about popular methods like N-W corner rule & Vogel’s approximation method to optimize a transportation related problem. Whereas for assignment problems, we will look into Hungarian method.
Sequencing - In sequencing we will learn about n jobs in 1 machine via – Shortest Processing Time rule or SPT & Earliest due date rule or EDD. And n jobs in 2 machines.
Queuing Theory - In queuing theory, we will get to know about the mathematical study of queues, Kendall notation, various queuing terminologies like arrival rate, service rate, calling population & many more.
Network Analysis - We will do network analysis via PERT & CPM which comes very handy for project planning & execution.
The bottom-line of this course is to teach you the academic aspects of operations research keeping in mind the practical application to a greater extent. By taking this course, you are not only increasing your knowledge in academic front but also gaining insights about optimization at industry level.
Who this course is for
- Mechanical engineering graduates & undergraduates.
- Industrial or manufacturing engineering graduates & undergraduates.
- Professionals working in industry who want to optimize something.
- University students having OR (Operations Research) as their subject.
- Aspirants preparing for post engineering competitive examination.
- With my mechanical engineering background I was eager to learn more about LPP. This course really delivers. Thank you! ~ Ray P
- It's a great course. I took this to brush up before I went to my masters. So, I took lot of time to learn more deeper about things which are just briefed here. Go for it ~ Darshan M V
- I've not seen such a good explanation of transportation & assignment problems anywhere. Really good numerical practice as well ~ Praksah J
- Very good course for quick revision ~ Sai Krishna U
- This was marvelous. Some lectures like simplex method are needed to be re-watch to understand clearly but that's understandable. You have not only taught optimization but also optimized the course time !! Superb !! ~ Prayag S
- Its really amazing that someone can make this tough subject so easier to grasp ~ Pradeep R
- Interesting insights about OR. Slides are also good ~ Arnab G
What you'll learn
- Linear Programming Problem LPP - Graphical method, Slope method, Simplex method
- Transportation Problem - North-West Corner rule or DENTZY's method, Vogel's approximation method (VAM)
- Assignment Problem - Hungarian method or Flood technique
- Sequencing - Shortest Processing Time (SPT) Rule, Earliest Due Date (EDD), n jobs in 2 machines
- Queuing Theory - Mathematical study of queues, Kendall Notation
- Network Analysis - Critical Path Method (CPM), Program Evaluation Review Technique (PERT)
- No experience is needed. Just a sound background of mathematics.
- The most important trait - "A keen & curious mind".