|Delivery Type||Delivery length / details|
|Workload Breakdown||Lectures and tutorials: 22 hours Worksheets ( 4 x 5 ): 20 hours Private study: 56 hours Examinations: 2 hours|
|Assessment Type||Assessment length / details||Proportion|
|Semester Exam||2 Hours conventional 2-hour examination||100%|
|Supplementary Exam||2 Hours conventional 2-hour examination||100%|
On successful completion of this module students should be able to:
1. formulate and solve simple problems in random arrival modelling;
2. set up and solve the steady-state equations governing a simple queue;
3. formulate a given real situation as a queueing model;
4. appreciate the failings of the simplest models and what modified models are trying to cover;
5. evaluate and use the reliability function, hazard function, mean time to failure and reliable lifetime of lifetime distributions in common use;
6. evaluate the reliability of systems of independent components;
7. calculate and interpret simple bounds on reliability;
explain the notation used in fault trees and be aware of their uses.
IMAPS has for some years been able to offer a very limited range of modules for final year students. With the imminent arrival of more staff, it is now proposed to rectify this by introducing Level 3 modules that can be extended to cater for Level M students also. This module introduces the important area of stochastic Operational Research; its companion module, MAM8120 has some common lectures but extends the applications. It is intended to offer this module in alternate years.
The module also introduces students to the properties of lifetime distributions, to study the reliability of systems of components and to gain an appreciation of how high levels of reliability and safety may be achieved in practice.
Modelling of Markovian arrival processes. Queues and their characteristics. Queue model notation.
The Simple Queue
Simple Markovian (M/M/1) Queue; basic theory; steady state solutions. Waiting times and their distribution. The output process.
Generalised Markovian systems
Queues where arrival and service rates are dependent on system size. Examples will include limited waiting rooms, multiple server queues, self-service queues, telephone exchange design, machine minding, server fatigue, etc.
Statistical Failure Models
Reliability and hazard functions, mean time to failure, reliable lifetime; distributions (Exponential, Weibull, Gamma, Gumbel, Log Normal) competing risks; simple bounds on reliability.
Series, parallel, k out of n systems. Path and cut sets, monotonic systems, modules. Bounds on system reliability. Fault trees.
|Skills Type||Skills details|
|Application of Number||Throughout the module.|
|Communication||Students will be expected to submit written worksheet solutions|
|Improving own Learning and Performance||Feedback via tutorials|
|Information Technology||Extensive use of spreadsheets.|
|Personal Development and Career planning||Students will be exposed to an area of application that they have not previously encountered.|
|Problem solving||All situations considered are problem-based to a greater or lesser degree.|
|Research skills||Students will be encouraged to consult various books and journals for examples of application.|
|Subject Specific Skills||Modelling of practical situations in stochastic terms|
Reading ListRecommended Text
Andrews, J. D. (2002.) Reliability and risk assessment /by JD Andrews and TR Moss. 2nd ed. Professional Engineering Pub Primo search Bedford, T. (2001.) Probabilistic risk analysis :foundations and methods /Tim Bedford, Roger Cooke. Cambridge University Press Primo search Grosh, Doris Lloyd. (c1989.) A primer of reliability theory /Doris Lloyd Grosh. Wiley Primo search Taha, H A (2003) Operations Research, an Introduction 7th Prentice_Hall Primo search Winston, W L (2004) Introduction to Probability Models: Operations Research Vol 2 Primo search
This module is at CQFW Level 6