QUEUING THEORY - QUEUING THEORY QUEUING SYSTEM SERVICE...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
QUEUING THEORY
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
QUEUING SYSTEM QUEUE SERVICE FACILITY CALLING POP. SERVED UNITS
Background image of page 2
CHARACTERISTICS OF CALLING POPULATON THE SIZE OF TE POPULATION THE PATTERN OF ARRIVALS AT THE QUEUING SYSTEM THE ATTIDUTE OF THE CALLING UNITS.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
THE SIZE OF TE POPULATION WHEN THERE IS NO LIMIT PLACED ON HOW MANY UNITS MAY SEEK SERVICE THE MODEL IS SAID TO HAVE AN INFINITE POPULATION. THE MAXIMUM NUMBER OF UNITS OR CUSTOMERS THAT MAY SEEK SERVICE IS FIXED AT THE FINITE VALUE. IT IS CALLED FINITE POPULATION.
Background image of page 4
THE PATTERN OF ARRIVALS AT THE QUEUING SYSTEM CALLING UNITS ARRIVE AT THE QUEUING SYSTEM EITHER ACCORDING TO SOME PREDETERMINED SCHEDULE OR IN A RANDOM FASHION. IF ARRIVALS ARE RANDOM THEN INTERARRIVAL TIME SHOULD BE DETERMINED.
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
MATHEMATICALLY CAN BE SHOWN THAT IF THE PROBABILITY DENSITY FUNCTION OF THE INTRARRIVAL TIME IS EXPONENTIAL, CALLING UNITS ARRIVE ACCORDING TO POISSON PROCESS.
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 15

QUEUING THEORY - QUEUING THEORY QUEUING SYSTEM SERVICE...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online