Summary: Stochastic Modelling Operation Management
- This + 400k other summaries
- A unique study and practice tool
- Never study anything twice again
- Get the grades you hope for
- 100% sure, 100% understanding
Read the summary and the most important questions on Stochastic Modelling Operation Management
-
1 Markov Chains
This is a preview. There are 5 more flashcards available for chapter 1
Show more cards here -
What is meant with the steady state probabilities?
Probabilities to describe long-run behaviour of a Markov chain. -
Explain the objective of the mean first passage time and how you calculate it;
Expected number of transitions before reaching state j given you are in state i. -
What is the definition of a closed set and what is closed set in the image.
When no state outside S is reachable from any state S. S1 and S2 are both closed sets. -
What is the definition of an absorbing state?
Whenever you enter an absorbing state you never leave the state. It is a closed set containing only one state. -
What is the definition of a transient state?
State i is transient when there exists a state j that is reachable from i but, i is not reachable from j.
There is a way to leave i but never return to i. -
When is a chain called ergodic?
When it communicates, is aperiodic recurrent. -
What is the opposite of ergodic?
Nonergodic -
2 Queuing theory
-
2.1 Terminology
This is a preview. There are 3 more flashcards available for chapter 2.1
Show more cards here -
What is meant with bulk arrivals
More than one arrival canoccur at a giveninstant (most of the time not allowed); -
What is a finite source model
Arrivals are drawn from small (most of the times ending) population; -
What are balked customers?
Customer arrives but fails to enter the system;
- Higher grades + faster learning
- Never study anything twice
- 100% sure, 100% understanding