Queuing Theory GATE Previous Year Questions and Solutions Part 1

Topics Covered What is Queuing Theory What is Queuing Model Introduction of Queuing Model Types of Queuing Model What is arrival Rate in Queuing Model What is Service Rate in Queuing Model Queuing model Problem M/M/1 Queuing Model Problem on M/M/1 Queuing Model  Solved GATE problem with M/M/1 Queuing Model Previous Video: Queuing Theory in Operation Research Next Video: Queuing Theory GATE Previous Year Questions and Solutions Part 2  

Read More

Queuing Theory in Operation Research

Queuing Theory in Operation Research Topics Covered What is Queuing Theory What is Queuing Model Introduction of Queuing Model Types of Queuing Model What is arrival Rate in Queuing Model What is Service Rate in Queuing Model Queuing model Problem M/M/1 Queuing Model Problem on M/M/1 Queuing Model  Solved GATE problem with M/M/1 Queuing Model Next Video: Queuing Theory GATE Previous Year Questions and Solutions Part 1

Read More

Assignment Problem – Hungarian method

Assignment Problem Hungarian method Solved Problem with this method GATE 2018 The Hungarian algorithm The Hungarian algorithm consists of the four steps below. The first two steps are executed once, while Steps 3 and 4 are repeated until an optimal assignment is found. The input of the algorithm is an n by n square matrix with only non-negative elements. Step 1: Subtract row minima For each row, find the lowest element and subtract it from each element in that row. Step 2: Subtract column minima Similarly, for each column, find the lowest element and…

Read More