The document discusses queuing systems and simulation of queuing systems. It provides examples of real-world queuing situations and defines key elements of queuing systems including arrivals, queues, servers, and outputs. It also describes measures used to evaluate system performance such as average number of customers, average wait times, and system utilization. Simulation is presented as an important technique for analyzing queuing systems when theoretical analysis is difficult.
Solving Of Waiting Lines Models in the Bank Using Queuing Theory Model the Pr...IOSR Journals
Waiting lines and service systems are important parts of the business world. In this article we describe several common queuing situations and present mathematical models for analyzing waiting lines following certain assumptions. Those assumptions are that (1) arrivals come from an infinite or very large population, (2) arrivals are Poisson distributed, (3) arrivals are treated on a FIFO basis and do not balk or renege, (4) service times follow the negative exponential distribution or are constant, and (5) the average service rate is faster than the average arrival rate. The model illustrated in this Bank for customers on a level with service is the multiple-channel queuing model with Poisson Arrival and Exponential Service Times (M/M/S). After a series of operating characteristics are computed, total expected costs are studied, total costs is the sum of the cost of providing service plus the cost of waiting time. Finally we find the total minimum expected cost.
Talks about what is Queuing and its application, practical life usage, with a complex problem statement with its solution. Pre-emptive and non-preemptive queue models and its algorithm.
Solving Of Waiting Lines Models in the Bank Using Queuing Theory Model the Pr...IOSR Journals
Waiting lines and service systems are important parts of the business world. In this article we describe several common queuing situations and present mathematical models for analyzing waiting lines following certain assumptions. Those assumptions are that (1) arrivals come from an infinite or very large population, (2) arrivals are Poisson distributed, (3) arrivals are treated on a FIFO basis and do not balk or renege, (4) service times follow the negative exponential distribution or are constant, and (5) the average service rate is faster than the average arrival rate. The model illustrated in this Bank for customers on a level with service is the multiple-channel queuing model with Poisson Arrival and Exponential Service Times (M/M/S). After a series of operating characteristics are computed, total expected costs are studied, total costs is the sum of the cost of providing service plus the cost of waiting time. Finally we find the total minimum expected cost.
Talks about what is Queuing and its application, practical life usage, with a complex problem statement with its solution. Pre-emptive and non-preemptive queue models and its algorithm.
MCM,MCA,MSc, MMM, MPhil, PhD (Computer Applications)
Working as Associate Professor at Zeal Education Society, Pune for MCA Progrmme.
Having 18 Years teaching experience
Queuing theory: What is a Queuing system???
Waiting for service is part of our daily life….
Example:
we wait to eat in restaurants….
We queue up in grocery stores…
Jobs wait to be processed on machine…
Vehicles queue up at traffic signal….
Planes circle in a stack before given permission to land at an airport….
Unfortunately, we can not eliminate waiting time without incurring expenses…
But, we can hope to reduce the queue time to a tolerable levels… so that we can avoid adverse impact….
Why study???? What analytics can be drawn??? Analytics means ---- measures of performance such as
1. Average queue length
2. Average waiting time in the queue
3. Average facility utilization….
Waiting Line Model is one of the decision line model.Waiting Line Model is one of the decision line model.Waiting Line Model is one of the decision line model.Waiting Line Model is one of the decision line model.
This slide was prepared as a part of presentation in a course work of Master in IT, IIT, University of Dhaka. The main slide was prepared by Dr. Sam Labi of Purdue University and Dr. Fred of MIT.
International Journal of Mathematics and Statistics Invention (IJMSI) inventionjournals
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
MCM,MCA,MSc, MMM, MPhil, PhD (Computer Applications)
Working as Associate Professor at Zeal Education Society, Pune for MCA Progrmme.
Having 18 Years teaching experience
Queuing theory: What is a Queuing system???
Waiting for service is part of our daily life….
Example:
we wait to eat in restaurants….
We queue up in grocery stores…
Jobs wait to be processed on machine…
Vehicles queue up at traffic signal….
Planes circle in a stack before given permission to land at an airport….
Unfortunately, we can not eliminate waiting time without incurring expenses…
But, we can hope to reduce the queue time to a tolerable levels… so that we can avoid adverse impact….
Why study???? What analytics can be drawn??? Analytics means ---- measures of performance such as
1. Average queue length
2. Average waiting time in the queue
3. Average facility utilization….
Waiting Line Model is one of the decision line model.Waiting Line Model is one of the decision line model.Waiting Line Model is one of the decision line model.Waiting Line Model is one of the decision line model.
This slide was prepared as a part of presentation in a course work of Master in IT, IIT, University of Dhaka. The main slide was prepared by Dr. Sam Labi of Purdue University and Dr. Fred of MIT.
International Journal of Mathematics and Statistics Invention (IJMSI) inventionjournals
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
2. Simulation of Queuing Systems
Introduction
Waiting line queues are one of the most important areas, where
the technique of simulation has been extensively employed.
The waiting lines or queues are a common site in real life
The waiting lines or queues are a common site in real life.
People at railway ticket window, vehicles at a petrol pump or at a
traffic signal, workers at a tool crib, products at a machining
center television sets at a repair shop are a few examples of
center, television sets at a repair shop are a few examples of
waiting lines.
2
3. Simulation of Queuing Systems
The waiting line situations arise, either because,
The waiting line situations arise, either because,
-There is too much demand on the service facility so
that the customers or entities have no wait for
getting service, or
-There is too less demand, in which case the service
f ilit h t it f th titi
facility have to wait for the entities
The objective in the analysis of queuing situations is
to balance the waiting time and idle time so as to
to balance the waiting time and idle time, so as to
keep the total cost at minimum.
3
4. Simulation of Queuing Systems
The queuing theory its development to an
The queuing theory its development to an
engineer A.K.Earlang, who in 1920, studied
waiting line queues of telephone calls in
C h D k
Copenhagen, Denmark.
The problem was that during the busy period,
t l h t bl t h dl
telephone operators were unable to handle
the calls, there was too much waiting time,
which resulted in customer dissatisfaction
which resulted in customer dissatisfaction.
4
6. Discrete Event Simulation Computation
example: air traffic at an airport
example: air traffic at an airport
events: aircraft arrival, landing, departure
arrival
8:00 departure
9:15
landed
arrival
9:30
schedules
processed event
current event
schedules
landed
8:05
simulation time
unprocessed event
Events that have been scheduled, but have not been
simulated (processed) yet are stored in a pending
6
simulated (processed) yet are stored in a pending
event list
Events are processed in time stamp order; why?
8. Queuing System
Population of Customers or calling source can be
considered either limited (closed systems) or unlimited
considered either limited (closed systems) or unlimited
(open systems).
Unlimited population represents a theoretical model of
systems with a large number of possible customers (a
systems with a large number of possible customers (a
bank on a busy street, a motorway petrol station).
Example of a limited population may be a number of
processes to be run (served) by a computer or a certain
processes to be run (served) by a computer or a certain
number of machines to be repaired by a service man.
It is necessary to take the term "customer" very generally.
Customers may be people machines of various nature
Customers may be people, machines of various nature,
computer processes, telephone calls, etc.
8
9. Queuing System
Arrival defines the way customers enter the
Arrival defines the way customers enter the
system.
Mostly the arrivals are random with random
Mostly the arrivals are random with random
intervals between two adjacent arrivals.
Typically the arrival is described by a random
Typically the arrival is described by a random
distribution of intervals also called Arrival
Pattern
Pattern.
9
10. Queuing System
Queue or waiting line represents a certain number
of customers waiting for service (of course the
queue may be empty).
Typically the customer being served is considered
yp y g
not to be in the queue. Sometimes the customers
form a queue literally (people waiting in a line for a
bank teller).
)
Sometimes the queue is an abstraction (planes
waiting for a runway to land).
There are two important properties of a queue:
There are two important properties of a queue:
Maximum Size and Queuing Discipline.
10
11. Queuing System
Maximum Queue Size (also called System
Maximum Queue Size (also called System
capacity) is the maximum number of customers that
may wait in the queue (plus the one(s) being
d)
served).
Queue is always limited, but some theoretical
models assume an unlimited queue length
models assume an unlimited queue length.
If the queue length is limited, some customers are
forced to renounce without being served
forced to renounce without being served
11
12. Applications of Queuing Theory
Telecommunications
Traffic control
Determining the sequence of computer
operations
Predicting computer performance
Health services (eg. control of hospital bed
assignments)
Ai t t ffi i li ti k t l
Airport traffic, airline ticket sales
Layout of manufacturing systems.
12
13. Example application of queuing theory
In many retail stores and banks
In many retail stores and banks
multiple line/multiple checkout system a
queuing system where customers wait for the next
q g y
available cashier
We can prove using queuing theory that :
throughput improves increases when queues are
used instead of separate lines
13
15. Queuing theory for studying networks
View network as collections of queues
View network as collections of queues
FIFO data-structures
Queuing theory provides probabilistic
g y p p
analysis of these queues
Examples:
Average length
Average waiting time
Probability queue is at a certain length
Probability a packet will be lost
15
16. Model Queuing System
Queuing System
Queue Server
Server System
Queuing System
Use Queuing models to
Describe the behavior of queuing systems
Evaluate system performance
16
18. Characteristics of queuing systems
Arrival Process
Arrival Process
The distribution that determines how the tasks
arrives in the system.
y
Service Process
The distribution that determines the task
The distribution that determines the task
processing time
Number of Servers
Total number of servers available to process the
tasks
18
19. Queuing System
Queuing Discipline represents the way the queue is organized
(r les of inserting and remo ing c stomers to/from the q e e)
(rules of inserting and removing customers to/from the queue).
There are these ways:
1) FIFO (First In First Out) also called FCFS (First Come First
Serve) - orderly queue.
) y q
2) LIFO (Last In First Out) also called LCFS (Last Come First Serve)
- stack.
3) SIRO (Serve In Random Order).
4) Priority Queue, that may be viewed as a number of queues for
various priorities.
5) Many other more complex queuing methods that typically change
the customer’s position in the queue according to the time spent
the customer s position in the queue according to the time spent
already in the queue, expected service duration, and/or priority.
These methods are typical for computer multi-access systems
19
20. Queuing System
Most quantitative parameters (like average queue
q p ( g q
length, average time spent in the system) do not
depend on the queuing discipline.
That’s why most models either do not take the
That s why most models either do not take the
queuing discipline into account at all or assume the
normal FIFO queue.
In fact the only parameter that depends on the
queuing discipline is the variance (or standard
deviation) of the waiting time There is this important
deviation) of the waiting time. There is this important
rule (that may be used for example to verify results
of a simulation experiment):
20
21. Queuing System
The two extreme values of the waiting time variance are for the
FIFO q e e (minim m) and the LIFO q e e (ma im m)
FIFO queue (minimum) and the LIFO queue (maximum).
Theoretical models (without priorities) assume only one queue.
This is not considered as a limiting factor because practical
systems with more queues (bank with several tellers with
systems with more queues (bank with several tellers with
separate queues) may be viewed as a system with one queue,
because the customers always select the shortest queue.
Of course, it is assumed that the customers leave after being
d
served.
Systems with more queues (and more servers) where the
customers may be served more times are called Queuing
Networks.
Networks.
21
22. Queuing System
Service represents some activity that takes time and
that the customers are waiting for. Again take it very
generally
generally.
It may be a real service carried on persons or
machines, but it may be a CPU time slice, connection
d f l h ll b i h d f
created for a telephone call, being shot down for an
enemy plane, etc. Typically a service takes random
time.
Theoretical models are based on random distribution
of service duration also called Service Pattern.
Another important parameter is the number of
Another important parameter is the number of
servers. Systems with one server only are called
Single Channel Systems, systems with more servers
ll d M lti Ch l S t
22
are called Multi Channel Systems
23. Queuing System
Output represents the way customers leave the
p p y
system.
Output is mostly ignored by theoretical models, but
sometimes the customers leaving the server enter
sometimes the customers leaving the server enter
the queue again ("round robin" time-sharing
systems).
Queuing Theory is a collection of mathematical
models of various queuing systems that take as
inputs parameters of the above elements and that
inputs parameters of the above elements and that
provide quantitative parameters describing the
system performance
23
24. Analysis of M/M/1 queue
Given:
Given:
• : Arrival rate of jobs (packets on input link)
• : Service rate of the server (output link)
: Service rate of the server (output link)
Solve:
L: average number in queuing system
L: average number in queuing system
Lq average number in the queue
W: average waiting time in whole system
W: average waiting time in whole system
Wq average waiting time in the queue
24
26. Kendall Notation 1/2/3(/4/5/6)
Six parameters in shorthand
Six parameters in shorthand
First three typically used, unless specified
1. Arrival Distribution
2. Service Distribution
3. Number of servers
4. Total Capacity (infinite if not specified)
5. Population Size (infinite)
6. Service Discipline (FCFS/FIFO)
26
27. Kendall Classification of Queuing Systems
The Kendall classification of queuing systems (1953) exists in several
The Kendall classification of queuing systems (1953) exists in several
modifications.
The most comprehensive classification uses 6 symbols: A/B/s/q/c/p
where:
where:
A is the arrival pattern (distribution of intervals between arrivals).
B is the service pattern (distribution of service duration).
s is the number of servers.
i th i di i li (FIFO LIFO ) O itt d f FIFO if t
q is the queuing discipline (FIFO, LIFO, ...). Omitted for FIFO or if not
specified.
c is the system capacity. Omitted for unlimited queues.
p is the population size (number of possible customers). Omitted for open
systems
systems.
27
28. Kendall Classification of Queuing Systems
These symbols are used for arrival and service patterns:
M is the Poisson (Markovian) process with exponential
distribution of intervals or service duration respectively.
Em is the Erlang distribution of intervals or service
duration.
D is the symbol for deterministic (known) arrivals and
constant service duration.
G is a general (any) distribution.
GI is a general (any) distribution with independent random
g ( y) p
values.
28
29. Kendall Classification of Queuing Systems
Examples:
D/M/1 = Deterministic (known) input, one
exponential server, one unlimited FIFO or
unspecified queue, unlimited customer population.
p q , p p
M/G/3/20 = Poisson input, three servers with any
distribution, maximum number of customers 20,
unlimited customer population.
unlimited customer population.
D/M/1/LIFO/10/50 = Deterministic arrivals, one
exponential server, queue is a stack of the
maximum size 9 total number of customers 50
maximum size 9, total number of customers 50.
29
30. Simulation of Queuing Systems
Simulation of Queuing Systems
Measures of system performance
The performance of a queuing system can be evaluated
in terms of a number of response parameters, however
the following four are generally employed.
the following four are generally employed.
1. Average number of customers in the queue or in the
system
2. Average waiting time of the customers in the queue or
in the system
3 System utilization
3. System utilization
4. The cost of the waiting time & idle time
30
31. Simulation of Queuing Systems
Measures of system performance
The knowledge of average number of customers in
the queue or in the system helps to determine the
i t f th iti titi Al t
space requirements of the waiting entities. Also too
long a waiting line may discourage the prospectus
customers, while no queue may suggest that service
customers, while no queue may suggest that service
offered is not of good quality to attract customers.
The knowledge of average waiting time in the queue
is necessary for determining the cost of waiting in
the queue.
31
32. Simulation of Queuing Systems
System Utilization
y
System Utilization that is the percentage capacity utilized
reflects that extent to which the facility is busy rather
than idle.
System utilization factor (s) is the ratio of average arrival
rate (λ) to the average service rate (µ).
S= λ/µ in the case of a single server model
µ g
S= λ/µn in the case of a “n” server model
The system utilization can be increased by increasing
the arrival rate which amounts to increasing the average
the arrival rate which amounts to increasing the average
queue length as well as the average waiting time, as
shown in fig 1. Under the normal circumstances 100%
system utilization is not a realistic goal.
32
34. Time Oriented Simulation
A factory has large number of semiautomatic machines.On 50%
y g
of the working days none of the machines fail. On 30%of the
days one machines fails and on 20%of the days two machines
fail. The maintenance staff on the average puts 65% of the
machines in order in one day, 30% in two days and remaining
5% in three days.
Simulate the system for 30 days duration and estimate the
y y
average length of queue, average waiting time and server
loading that is the fraction of time for which server is busy.
34
35. Time Oriented Simulation
Solution:
Th i t i i l i d l Th f il f th
The given system is a single server queuing model. The failure of the
machines in the factory generates arrivals, while the maintenance
staff is the service facility. There is no limit on the capacity of the
system in other words on the length of waiting line. The population
of machines is very large and can be taken as infinite.
Arrival pattern:
On 50%of the days arrival=0
O % f
On 30%of the days arrival=1
On 20%of the days arrival=2
Expected arrival rate=0*.5+1*.3+2*.2=0.7 per day.
S i tt
Service pattern:
65% machines in 1 day
30% machines in 2 days
5% machines in 3 da s
35
5% machines in 3 days
36. Time Oriented Simulation
Average service time: 1*.65+2*.3+3*.05=1.4 days
E t d i t 1/1 4 0 714 hi d
Expected service rate=1/1.4=0.714 machines per day
The expected arrival rate is slightly less than the expected service rate
and hence the system can reach a steady state. For the purpose
of generating the arrivals per day and the services completed per
g g p y p p
day the given discrete distributions will be used.
Random numbers between 0 and 1 will be used to generate the
arrivals as under.
0.0<r<=0.5 Arrivals=0
0.5<r<=0.8 Arrivals=1
0.8<r<=1.0Arrivals=2
Si il l d b b t 0 d 1 ill b d f
Similarly, random numbers between 0 and 1 will be used for
generating the service times ( ST)
0.0<r<=0.65ST=1day
0 65<r<=0 95ST=2days
36
0.65<r<=0.95ST=2days
0.95<r<=1.0 ST=3 days
37. Time Oriented Simulation
In the time-oriented simulation, the timer is advanced in fixed steps
of time and at each step the system is scanned and updated.
The time is kept very small, so that not many events occur during
this time
this time.
All the events occurring during this small time interval are assumed
to occur at the end of the interval.
At start of the simulation, the system that is the maintenance facility
y y
can assumed to be empty, with no machine waiting for repair.
On day 1, there is no machine in the repair facility.
On day 2 there are 2 arrivals, the queue is made 2.
Since service facility is idle, one arrival is put on service and queue
becomes 1.
Server idle time becomes 1 day and the waiting time of customers
is also 1 day Timer is advanced by one day
is also 1 day. Timer is advanced by one day.
The service time, ST is decreased by one and when ST becomes
zero facility becomes idle.
Arrivals are generated which come out to be 1, it is added to the
37
g ,
queue.
38. Time Oriented Simulation
Facility is checked, which is idle at this time.
One customer is drawn from the queue, its service time is
generated.
Idle time and waiting time are updated. The process is continued till
th d f i l ti
the end of simulation.
The following statistics can be determined.
Machine failures( arrivals) during 30 days=21
Arrivals per day=21/30=0.7
Waiting time of customer=40 days
Waiting time per customer=40/21=1.9 days
Average length of the queue=1.9
Server idle time=4 days=4/30* 100=13.33 %
Server loading=( 30-4)/30=0.87
38
g ( )
40. Simulation on queuing system
Tutorial
In a manufacturing system parts are being made at a
g y p g
rate of one every 6 minutes. They are two types A and
B and are mixed randomly with about 10 percent of
type B A separate inspector is assigned to examine
type B. A separate inspector is assigned to examine
each type of parts. The inspection of a part takes a
mean time of 4 minutes with a standard deviation of 2
i b B k i 20 i d
minutes , but part B takes a mean time 20 minutes and
a standard deviation of 10 minutes. Both inspectors
reject about 10% of the parts they inspect. Simulate
j p y p
the system for total of 50 type A parts accepted and
determine , idle time of inspectors and average time a
part spends in system
40
part spends in system.