? Credit Points : 10  ? SCQF Level : 11  ? Acronym : MAT-P-SM

Markov chains: discrete state, discrete time chains; classification of states; stationary and limit distributions; absorption problems; first passage and recurrence times; insurance, reservoir control, inventory, manpower planning problems; Markov processes in continuous time, viewed as a natural generalization of birth-death processes covered in the Simulation course.

Queueing systems; balance equations for M/M/1 systems and birth-death queues; Little's law; imbedded Markov chain analysis for M/G/1 systems; optimisation problems for single class queues; dynamic control of multi-class queueing systems.

? Pre-requisites : PGs only

Home subject area

Operational Research, (School of Mathematics, Schedule P)

? Normal year taken : Postgraduate

? Delivery Period : Semester 2 (Blocks 3-4)

? Contact Teaching Time : 2 hour(s) per week for 10 weeks

Knowledge of behaviour of discrete-state discrete and continuous time Markov Chains. Where appropriate, the ability to formulate real-life problems as a Markov Process. Understanding of elementary queueing theory. Awareness of modern developments in the control of queueing systems.

Coursework 15% and Examination 85%

Exam times

Diet Diet Month Paper Code Paper Name Length 1ST May 1 - 2 hour(s)

The Course Secretary should be the first point of contact for all enquiries.

Course Secretary

Mrs Frances Reid
Tel : (0131 6)50 4883
Email : f.c.reid@ed.ac.uk

Course Organiser

Dr Julian Hall
Tel : (0131 6)50 5075
Email : J.A.J.Hall@ed.ac.uk

Course Website : http://student.maths.ed.ac.uk

School Website : http://www.maths.ed.ac.uk/

College Website : http://www.scieng.ed.ac.uk/