SlideServe
Menu
Préférences
© SlideServe · v2026

Simulation

kjosephine avatar
9 diapositives · 323 Views · Jan 04, 2020

Learn how to simulate queuing systems with continuous variables for performance analysis and optimization. Understand various distributions and conversion techniques for accurate modeling.

Simulation - slide 1
01 / 9Simulation
1 / 17

Télécharger la présentation

Simulation
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation
  1. Simulation Continuous Variables Dr. Satish Nargundkar

  2. 0 1 Distributions • Variables to be simulated may be normal (e.g. height) or exponential (e.g. service time) or various other distributions. • Task is to convert uniform distribution to the required distribution. Freq Freq 0 infinity Dr. Satish Nargundkar

  3. Application - Queuing Systems • A queuing system is any system where entities (people, trucks, jobs, etc.) wait in line for service (processing of some sort) – • retail checkout lines, jobs on a network server, phone switchboard, airport runways, etc. Dr. Satish Nargundkar

  4. Queuing System Inputs • Queuing (waiting line) systems are characterized by: • Number of servers / number of queues • SSSQ – Single Server Single Queue • SSMQ – Single Server Multiple Queue • MSSQ – Multiple Server Single Queue • MSMQ - Multiple Server Multiple Queue • Arrival Rate (Arrival Intervals) • Service Rate (Service Times) Dr. Satish Nargundkar

  5. Performance Variables (outcome) • Performance of a queuing system is measured by • Average time waiting in queue/system • Average number of entities in queue/system Time in Queue Service Time Arrival time Service Begins Service Ends Time in System Dr. Satish Nargundkar

  6. Distributions in Queuing • Arrival Intervals (time between two consecutive arrivals) and Service Time (time to serve one customer) are exponentially distributed. • Confirm it yourself by watching cars on a street! Dr. Satish Nargundkar

  7. Sample Problem • A loading dock (SSSQ) has trucks arriving every 36 minutes (0.6 hrs) on average, and the average service (loading / unloading) time is 30 minutes (0.5 hrs). A new conveyer belt system can reduce that to 15 minutes (0.25 hours). Simulate the arrival of 200 trucks to see how performance would be affected by the new system. Dr. Satish Nargundkar

  8. Simulating Exponential Distributions • To convert the uniform distribution of the random numbers to an exponential distribution, take the negative natural log of the random numbers. • This creates an exponential distribution with an average of 1.00. • To get an average of 0.6 (to represent average arrival interval in hours), simply multiply result by 0.6. • Thus, the conversion formula is: –ln(rand())*µ where µis the mean of the exponential distribution desired. Dr. Satish Nargundkar

  9. 0 1 Sample Conversion Average: infinity 0 ….. ….. Dr. Satish Nargundkar