Scribd
Upload
28 views

Simulation Sec

This document discusses simulation examples using queueing systems. It describes generating random numbers for interarrival times and service times to simulate a single-server queue. The simulation involves determining input characteristics, constructing a simulation table, and generating values for each repetition to calculate responses. Key steps include computing arrival and service times, and tracking the order of arrival and service events in the simulation table.

Uploaded by

Aya Hegazy
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
28 views

Simulation Sec

This document discusses simulation examples using queueing systems. It describes generating random numbers for interarrival times and service times to simulate a single-server queue. The simulation involves determining input characteristics, constructing a simulation table, and generating values for each repetition to calculate responses. Key steps include computing arrival and service times, and tracking the order of arrival and service events in the simulation table.

Uploaded by

Aya Hegazy
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 11

Simulation Examples

This chapter presents several examples of simulations that can be performed by devising a simulation table either manually or with a spreadsheet. The simulations in this chapter entail three steps:

1. Determine the characteristics of each of the inputs to the simulation.


2. Construct a simulation table. Each simulation table is different, for each is developed for the problem at hand. An example of a simulation table is shown in Table 2.1.

For each repetition i , generate a value for each of the p inputs, and evaluate the function, calculating a value of the response A response typically depends on the inputs and one or more previous responses.

2.1 Simulation of Queueing Systems Queueing system is described by its calling population, the nature of the arrivals, the service mechanism.

Finally, service in Queueing system take by the order of their arrival (often called FIFO: first in, first out).

What happen If a unit has just completed service?

Note that the server has only two possible states: it is either busy or idle.

What happen If The arrival event occurs?

The unit may find the server either idle or busy.

Random numbers are distributed uniformly and independently on the interval (0, 1). Random digits are uniformly distributed on the set Random numbers can also be generated in simulation packages and in spreadsheets such as Excel. For example, Excel has a macro function called RAND() that returns a .random. number between 0 and 1. In a single-server queueing system interarrival times and service times are generated by using random number.

These five interarrival times are used to compute the arrival times of six customers at the queueing system.

the interarrival times and service times used to simulate the single-server queueing system.

Time Service Begins(i)= max(Arrival Time(i), Time Service Begins(i-1)+ Service Time(i-1)). Time Service Ends(i)= Time Service Begins(i)+ Service Time(i).

The occurrence of the two types of events in chronological order is shown in Table 2.5

If we want generate random number to interarrival time and service time by other way

Finally, Simulation Table for Queueing Problem

1. The average waiting time for a customer is 2.8 minutes.

2. The probability that a customer has to wait in the queue is 0.65.

3. The fraction of idle time of the server is 0.21.

4. The average service time is 3.4 minutes

You might also like