OUTPATIENT QUEUING MODEL DEVELOPMENT FOR HOSPITAL APPOINTMENT SYSTEM
|
|
|
- Barry Pearson
- 9 years ago
- Views:
Transcription
1 OUTPATIENT QUEUING MODEL DEVELOPMENT FOR HOSPITAL APPOINTMENT SYSTEM Obulor R. 1, Eke B. O. 2 1 Dept. of Computer Science, University of Port Harcourt, Nigeria 2 [email protected], Dept. of Computer Science, University of Port Harcourt, Nigeria Abstract In many hospitals, Patients wait for long time in the healthcare facility before they are attended to by the health personnel. This trend is on the increase and it is a potential threat to healthcare services. In Nigeria, specialist, teaching and general hospitals with large number of patients have cases where patients may not be attended to on time while others may end up going home without receiving medical attention. An efficient queuing model for proper appointment system is proposed as the solution to the long waiting times in these hospitals in this paper. The appointment queuing system provides better utilization of resources and reduces patients waiting times in the general outpatient department before consultation with the Doctor. Arrival rate and pattern, availability of medical services and preferences, employees experience and availability of information technology are factors that affect the performance of an appointment system. This research work provides an efficient outpatient appointment queuing model for proper appointment scheduling thus, reduces patients waiting times, doctors idle time and overtime as well as improving the outpatient s satisfaction. Keyword: Outpatient, Queue, Hospital, Appointment System 1. Introduction The Hospital is a healthcare facility where patients receive treatment and get effective and efficient services from specialized staff and equipment. A queue is an example of a linear data structure, or more abstractly a sequential collection. Queues provide services in computer science and operations research where various entities such as data, objects, persons, or events are stored and held to be processed later [1]. Queues are first-in, first-out: elements are removed in the same order in which they are inserted, and we usually imagine inserting at the back and removing from the front of a queue[2]. The queuing model is the use of the queuing principle in developing a model that provides efficient performance measures of service facilities in the hospital inflow units and outpatient services. In Nigeria, the specialist hospitals, teaching hospitals and general hospitals seem to attract the largest number of patients often making the waiting time and the queue to be very long. In some cases, some patient may not be attended to early while others may end up going home without receiving attention. In these hospitals, queue or a waiting line of patients occurs as a result of high demand of health services meaning that the demand for health care services by the citizens exceeds the capacity of the service facility. Queuing can be dully represented with arrival process of patients (in) and service provision (out) which are the major components of every queuing system. 15
2 Thus, queuing system servers are the nurses, trained counter personnel including the IT staff and the entire equipment specially put in place for the active procedures required while clients include the walk in patients who arrive at the hospital, wait for the required service, obtain it and then leave upon service completion or walk to another department expecting supplementary service. 2. Queuing Theory The first ever queuing theory was developed by a Danish telecommunication engineer, Agner Krarup Erlang. Erlang A. K. also analyzed a single facility M/M/s queues called Erlang C mathematical model where arrivals of customers are based on a Poisson process [3]. Erlang's model inspires mathematicians, scientist, engineers, and Computer Scientist to deal with problems using queuing theory and gave an explicit insight of an additional quality of service to limit waiting times especially in the queue. Deques, or double-ended queues, additionally support insertion and removal from both ends. Queues and deques are used for breadth-first searches of state spaces and also find use in simulation contexts [4]. Deques also occur in Hospitals since prominent patients may be added from front of queues to get quick services while the last to arrive may decide not to wait if the queue is long and then get out of the queue; creating a Deque situation. Another major milestone in the history of queuing theory was David G. Kendall [5]. Kendall introduced the A/B/C notation called the Kendall s notation which depict the characteristics of a queuing system which has become the standard in classifying queuing theory. Phillip M. Morse published an early and informative book on queuing theory and one of the first comprehensive books on queuing theory was authored by Thomas L. Saaty in 1961 [6]. These early queuing theory books have been a source of help to educators, scholars and researchers in various fields such as mathematics, sciences, management, computer science, accounting, and healthcare to deal with waiting problems using queuing theory. Queuing theory was applied on networks of packet switching in 1960s by Leornard Kleinrock and this development lead to the birth of the internet. In 1969, the Host computer of Leornard became the first node of the Internet and the first message to pass over the internet was transmitted from there. In reality, operations in service demonstrate features that are not captured by the early queuing models like Erlang, Jackson, etc[7]. The waiting time is a length of time in which a person certainly waits in sequence for a definite activity to commence as a result of service requested or obligated. The waiting process is a state or an act of expecting or looking forward to service that is about to be received. Usually, some patients waits patiently for service while others are restless and intolerant of delays (impatient) of service. Long waiting time of patients registered in urban health centers in developing country is a serious issue. Similarly, in Nigeria public healthcare systems, patients waits restlessly with ill health in long queue. This waiting problem has prompt some patients to influence the queue in various ways. The healthcare system especially the hospital, can apply queuing theory in patient consultation with the doctor, patient waiting time, pharmacy, emergency room, operation room, registration and filling of patient file etc. Historically, queuing theory has been used to model work environment, productivity, patients waiting time, staffing, hospital bed and emergency 16
3 department. Mathematical models and performance measures are queuing theory tools used to effectively improve the inflow of patients through a queuing system model. 2.1 Appointment System Hospital appointment system is an early practice in healthcare. Appointment scheduling is an administrative responsibility that ensures the smooth running of a system especially the healthcare system. Systems with appointments have an orderly arrival pattern of patients (customers). Traditionally, healthcare appointment system has considered doctor s time more valuable to that of the patients. This has been the belief and practice in most Nigeria Government owned hospitals where doctors do not keep to working time so much that they often go on break several times before the end of the day s shift. This old practice has led to patients long waiting time due to the increase in the doctors idle time and inadequate queuing system in these hospitals. Modern development in appointment system has been focused on decisive time factors as regards patients and doctors. Hence, appointment system can be scheduled in two ways; static and dynamic [8]. Management of patients appointment system has recorded early works and development in queuing model starting from the work of Welch and Bailey [6]. People have busy lifestyle as such have zero tolerance for waiting especially in hospitals for treatment. Also, patients waiting time can be greatly minimized with the use of mathematical model to evaluate the waiting time interval for patients and doctors [9]. The need to develop a queuing system for hospital appointment booking is very necessary and profitable for healthcare appointment system increases patient satisfaction as well as reducing the burden on staff having to control the calling population, depends on manual processes for selection of an appointment time for a patient and makes it easier for scheduling appointments across departments or units. 3. Analysis and Design Analysis is the investigation of a system with intention of understanding how it operates and the procedures that are involved and how to effectively improve on the system. The researcher carried out series of interviews to get a general overview and to see the factors that affects patients waiting times in the general outpatient clinic or department in a hospital system. The data gathered and information obtained was used to model a proposed outpatient service and arrival pattern in Government owned hospitals in Nigeria. The hospitals under review uses manual appointment system as such patients experiences longer waiting time like 2-3hours and above on queue before consultation with a doctor. This makes patients feel neglected and maltreated compare to hospitals with computerized appointment system in place. The appointment system in use allows all patients to be assigned to the same arrival time (single block rule) for example morning or afternoon is applied in these hospitals and patients are served based on their arrival time that is first come first serve (FCFS). The multiple phase single channel with M/M/1/I queuing model is used where patients arrives randomly following a Poisson distribution with infinite population [10]. The UPTH is managed by a three-tier managerial system consisting of; the Board of Management, Hospital Management Committee 17
4 (BMC) and the 31 Departments while the Braithwaite Memorial Specialist Hospital (BMH) is equipped and managed by the Rivers State Government through the Rivers State Hospital Management Board and it has 18 departments. These hospitals were established to facilitate adequate training of medical students and also for the welfare of Rivers people and Nigerians respectively. Figure 1. System Flow Diagram These hospitals general outpatient departments use two consultation type; old (review) patients and new patients. From figure 1, the new patients are those visiting the hospital for the first time for treatment and the old patients are those who have visited the hospital previously. The system entails that on arrival at the hospital, patients request appointment at the hospital card personnel desk (counter) in the outpatient department. Upon appointments request, patient s folder is sorted and a tally with a serial number is being given based on arrival time for old (reviewed) patients and new patients must first be registered with the hospital, then a file will be created before issuance of tally. The nurses on duty acts as the scheduler in these hospitals and calls patients to the consultation room based on the tally earlier issued which is a first come, First service (FCFS) queue discipline. Pile-up scheduling is used since there 18
5 is no specified time slot for the length of consultation with the doctor and having a consultation with the doctor. After consultation with a doctor, the patient is either admitted, treated or referred to other department while others are scheduled for review or routine consultation. Table 1. One Month Statistics of Patients Visiting the General Outpatient Department. Statistics Mon. Tue. Wed. Thur. Fri. Total Number of patients present Total Number of patients Seen Total Number of patients Not Seen Total Number of Old patients Total Number of New patients Total Number of Male patients Total Number of Female patients Figure 2: Patients Daily Statistics in the General Outpatient Department In Table 1 above, a detailed one month statistics of patients visiting the outpatient department showing the total number of patients present, seen, not seen, old and new patients, male and female patients. This comprehensive statistics will help us to implement the proposed system for the hospital. In order to determine the need of a new queuing system in the hospital, possible conflicting requirements of the management, staff and 19
6 patients must be put into consideration. The new system uses an appointment system which assigns an appointment time slot to patients in the hospitals thus reduces patients waiting time and evaluates the quality of services offered in the hospitals. 4. Algorithm The algorithm for the queuing system is as specified below : Step 1: Create an empty queue {(void enqueue(string Name_of_Patient) Step 2: Insert a new string onto queue String { dequeue() Step 3: Remove and return the string least recently added Step 4: Is the queue empty? { boolean isempty() Step 5: Repeat 1 to 4 till done Step 6: Stop Assuming that each patient is represented using a Name; which is a String. A simple representation of the algorithm using java syntax is illustrated below: Public Class QueueOfPatients { private Node first, last; private class Node { String Name_of_Patient; Node next; public boolean isempty() { return first == null; public void enqueue(string Name_of_Patient) { Node oldlast = last; last = new Node(); last.name_of_patient = Name_of_Patient; last.next = null; if (isempty()) first = last; else oldlast.next = last; public String dequeue() { String Name_of_Patient = first. Name_of_Patient; first = first.next; if (isempty()) last = null; return Name_of_Patient; The algorithm can be used in the implementation of the system using any programming language or tool. 5 Model Development We assume that the calling population (patients ) arrives in a Poisson process to the hospital with an average of 10 patients per minutes. The system is modeled as a Poisson process [11] showing the average inter-arrival time and probability of having more than 15 patients. Given an average rate as: τ = 1/E {r=λ (1) Thus, the parameter of distribution λ can be translated as the average rate of patients arrivals. τ = 1 λ (2) = 1 = 6(sec.) 10/60 Probability of having more than 15 patients per minutes P r = {Y>15 = P r {Y=16 + P r {Y=17+ P r {Y=18+ (3) Using the equation: P(n,t) = (λt) n e (λt) (4) n! Substituting the values numerically, we have: P r {Y>15 = 1- n! =
7 6. Result and Discussion The health system design is a conflicting issue due to the increase in the calling population (patients). These patients just walk-in and expects to get the needed treatment in little or no time with or without queue with different health problems that are mutually related. These correlated health services has led to difficulty in classifying services based on different approaches for designing multi-channel specialty service facilities. From flow chart in figure 1, our statistical calculations of the data collected from the patients record book at the general outpatient department shows that for a period of one month, the following database analysis holds; there are a total number of 2211 patients present, 1,870 (84.58%) patients seen, 341 (15.42%) patients not seen, 999 (45.18%) old(review) patients, 1,212 (54.82%) new patients, 823 (37.22%) male patients and 1,388 (62.78%) female patients. These patients have different health challenges that require prompt medical attention. The appointment system shows the relationship among the different tables. i. Reserves: The reserve page is used to book for appointment by the counter personnel who is in-charge of assigning patients for consultation. ii. Calendar: The calendar shows year, month, week and day available for appointment. iii. Login: The login section provides a secure access to information by only registered users. iv. Patients: Outpatients can always login to view their appointment date and time. v. Staff: this section provides doctors, nurses, counter personnel and administrators access to patients appointment date and medical history. 6.1 Experimental Setup This section describes the software packages and tools we used in development, implementation, testing and documentation of our software application. These are important and indispensible software packages and tools used in setting up our experiment: i. XAMPP Server ii. AJAX iii. Adobe Dreamweaver CS5 iv. Calendar In our experiment for testing the application, our developed UPTH Outpatient Appointment System application was used to secure an appointment slot for consultation and some of the outputs generated from the appointment testing were: Patients records were entered into the input parameters; patients appointments were booked and a monthly, weekly and daily view of appointments were shown respectively. The hospital card personnel page is where consultation time slots are being assigned, registration of patients are being carried out and also patients medical history stored in the database can be accessed. 7. Summary and Conclusion The Appointment system designed is used to reduce patient waiting time, work efficiency and other hospital management tool thereby implementing an efficient queuing system for work efficiency and patients satisfaction. Queuing model seems difficult to implement due to the increase in the calling population. In essence, queuing system is used to achieve better utilization of resources and it reduces patient waiting times in hospital using an appointment system. This research has adopted several hospital activities and all other 21
8 associated means by which a healthcare appointment queuing system could be developed and implemented due to the need to improve patients satisfaction and to improve the development of the hospital services. Reference [1] Adebayo P. I., Olajide O. A., and Kehinde O. W. (2014): Dependable Online Appointment Booking System for NHIS Outpatient in Nigerian Teaching Hospital. International Journal of Computer Science & Information Technology (IJCSIT) Vol 6, No4. DOI: /ijcsit [2]. Shawn T. O. (2015) Implementing Persistent O(1) Stacks and Queues in R, The R Journal, Vol. 7/1, ISSN Queuing Models. Springer New York Heidelberg Dordrecht London. [8] Cayirli T. and Emre V. (2003): Outpatient Scheduling in Healthcare, Production and Operation Management, vol 12(4). [9] Jackson, J. R. (1957). Networks of waiting lines. Operations Research 5(4) [10] Kelly, F. P. (1975). Networks of queues with customers of different types. Journal of Applied Probability 12(3) [11] Green, L. (2006). Queuing analysis in healthcare, in Patient Flow: Reducing Delay in Healthcare Delivery, Hall, R.W., ed., Springer, New York, [3] Erlang, A. K. (1918). Solutions of some problems in the theory of probabilities of significance in automatic telephone exchanges. The Post Office Electrical Engineers [4]. Grether, A. Neumann, and K. Nagel.(2012) Simulation of urban traffic control: A queue model approach. Procedia Computer Science, 10: , [p118] [5] Kendall, D. G. (1953). Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. Annals of Mathematical Statistics, 24(3), [6] Bailey, N.T.J. (1954) Queuing for medical care. Applied Statistics, 3, [7] Nick T. T. (2012). Fundamentals of Queuing Systems: Statistical Methods for Analyzing First Author Second Author Ms. Obulor, Ruth is an M.Sc Research Student at the Computer Science Department, University of Port Harcourt. Her research interest is in Algorithm, and Software Engineering. She is keen in solving real life challenges using IT tools for the improvement of society. Eke Bartholomew PhD, MCPN, MACM, FIPMD is a Software Engineer and Lecturer at the Department of Computer Science, University of Port Harcourt and Java/PHP Application Developer in Oyol Computer Consult Inc. His research interest is in Software Engineering Methodologies and Embedded systems. 22
Engineering 2,3,4,5 Department of Computer Science & Engineering, Shree.L.R.Tiwari College of Engineering. @IJMTER-2016, All rights Reserved 242
Hospital Appointment Scheduling System Using Intelligent Agent Agent Based Appointment Scheduler Prof. Deepali Patil 1, Bhavna Tiwari 2, Harshad Solanki 3, Aditya Pawar 4, Ashutosh Shah 5 1 Assistant Professor,
LECTURE - 1 INTRODUCTION TO QUEUING SYSTEM
LECTURE - 1 INTRODUCTION TO QUEUING SYSTEM Learning objective To introduce features of queuing system 9.1 Queue or Waiting lines Customers waiting to get service from server are represented by queue and
Network Design Performance Evaluation, and Simulation #6
Network Design Performance Evaluation, and Simulation #6 1 Network Design Problem Goal Given QoS metric, e.g., Average delay Loss probability Characterization of the traffic, e.g., Average interarrival
Chapter 1. Introduction
Chapter 1 Introduction 1.1. Motivation Network performance analysis, and the underlying queueing theory, was born at the beginning of the 20th Century when two Scandinavian engineers, Erlang 1 and Engset
Chapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi
Chapter 13 Waiting Lines and Queuing Theory Models - Dr. Samir Safi TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1) A goal of many waiting line problems is to help
QUEUING THEORY. 1. Introduction
QUEUING THEORY RYAN BERRY Abstract. This paper defines the building blocks of and derives basic queuing systems. It begins with a review of some probability theory and then defines processes used to analyze
Load Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: [email protected] Abstract Load
LECTURE 16. Readings: Section 5.1. Lecture outline. Random processes Definition of the Bernoulli process Basic properties of the Bernoulli process
LECTURE 16 Readings: Section 5.1 Lecture outline Random processes Definition of the Bernoulli process Basic properties of the Bernoulli process Number of successes Distribution of interarrival times The
The problem with waiting time
The problem with waiting time Why the only way to real optimization of any process requires discrete event simulation Bill Nordgren, MS CIM, FlexSim Software Products Over the years there have been many
Cumulative Diagrams: An Example
Cumulative Diagrams: An Example Consider Figure 1 in which the functions (t) and (t) denote, respectively, the demand rate and the service rate (or capacity ) over time at the runway system of an airport
M/M/1 and M/M/m Queueing Systems
M/M/ and M/M/m Queueing Systems M. Veeraraghavan; March 20, 2004. Preliminaries. Kendall s notation: G/G/n/k queue G: General - can be any distribution. First letter: Arrival process; M: memoryless - exponential
QUEUES. Primitive Queue operations. enqueue (q, x): inserts item x at the rear of the queue q
QUEUES A queue is simply a waiting line that grows by adding elements to its end and shrinks by removing elements from the. Compared to stack, it reflects the more commonly used maxim in real-world, namely,
4 The M/M/1 queue. 4.1 Time-dependent behaviour
4 The M/M/1 queue In this chapter we will analyze the model with exponential interarrival times with mean 1/λ, exponential service times with mean 1/µ and a single server. Customers are served in order
Response Times in an Accident and Emergency Service Unit. Apurva Udeshi [email protected]
IMPERIAL COLLEGE, LONDON Department of Computing Response Times in an Accident and Emergency Service Unit Apurva Udeshi [email protected] Supervisor: Professor Peter Harrison Second Marker: Dr. William
Common Data Structures
Data Structures 1 Common Data Structures Arrays (single and multiple dimensional) Linked Lists Stacks Queues Trees Graphs You should already be familiar with arrays, so they will not be discussed. Trees
Queuing Theory II 2006 Samuel L. Baker
QUEUING THEORY II 1 More complex queues: Multiple Server Single Stage Queue Queuing Theory II 2006 Samuel L. Baker Assignment 8 is on page 7. Assignment 8A is on page 10. -- meaning that we have one line
Optical Network Traffic Control Algorithm under Variable Loop Delay: A Simulation Approach
Int. J. Communications, Network and System Sciences, 2009, 7, 652-656 doi:10.4236/icns.2009.27074 Published Online October 2009 (http://www.scirp.org/ournal/icns/). Optical Network Traffic Control Algorithm
Research of Patient s Nursing Care Demand at Emergency Room
Research of Patient s Nursing Care Demand at Emergency Room Ching Hsiang Chang, Dept. of Health Care Administration of Chang Jung Christian University Dorgi Harnod, MD MPH, SICU of Shin Kong Memorial Hospital
Discrete-Event Simulation
Discrete-Event Simulation Prateek Sharma Abstract: Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the
AE64 TELECOMMUNICATION SWITCHING SYSTEMS
Q2. a. Draw the schematic of a 1000 line strowger switching system and explain how subscribers get connected. Ans: (Page: 61 of Text book 1 and 56 of Text book 2) b. Explain the various design parameters
Universidad Carlos III de Madrid
Universidad Carlos III de Madrid Algorithms and Data Structures (ADS) Bachelor in Informatics Engineering Computer Science Department Lists, Stacks and Queues. Authors: Isabel Segura Bedmar April 2011
Quiz 4 Solutions EECS 211: FUNDAMENTALS OF COMPUTER PROGRAMMING II. 1 Q u i z 4 S o l u t i o n s
Quiz 4 Solutions Q1: What value does function mystery return when called with a value of 4? int mystery ( int number ) { if ( number
The Analysis of Dynamical Queueing Systems (Background)
The Analysis of Dynamical Queueing Systems (Background) Technological innovations are creating new types of communication systems. During the 20 th century, we saw the evolution of electronic communication
Analysis of a Production/Inventory System with Multiple Retailers
Analysis of a Production/Inventory System with Multiple Retailers Ann M. Noblesse 1, Robert N. Boute 1,2, Marc R. Lambrecht 1, Benny Van Houdt 3 1 Research Center for Operations Management, University
IMPLEMENTATION OF HYBRID SOFTWARE ARCHITECTURE FRAMEWORK IN CLINICAL INFORMATION SYSTEM: A CASE STUDY OF A MALAYSIAN CLINIC
VOL. 1, NO. 2, NOVEMBER 215 ISSN 1819-668 26-215 Asian Research Publishing Network (ARPN). All rights reserved. IMPLEMENTATION OF HYBRID SOFTWARE ARCHITECTURE FRAMEWORK IN CLINICAL INFORMATION SYSTEM:
Online Appointment Scheduling System for Hospitals An Analytical Study
Online Appointment Scheduling System for Hospitals An Analytical Study Nazia S Department of Computer Science and Engineering Rama Rao Adik Institute of Technology, Nerul, Navi Mumbai, Maharashtra, India
Web Server Software Architectures
Web Server Software Architectures Author: Daniel A. Menascé Presenter: Noshaba Bakht Web Site performance and scalability 1.workload characteristics. 2.security mechanisms. 3. Web cluster architectures.
PRIORITY DISPATCH SCHEDULING IN AN AUTOMOBILE REPAIR AND MAINTENANCE WORKSHOP
Journal of Engineering Science and Technology Vol. 6, No. 5 (2011) 606-618 School of Engineering, Taylor s University PRIORITY DISPATCH SCHEDULING IN AN AUTOMOBILE REPAIR AND MAINTENANCE WORKSHOP AKINYEMI
Improving Outpatient Waiting Time Using Simulation Approach
2014 UKSim-AMSS 8th European Modelling Symposium Improving Outpatient Waiting Time Using Simulation Approach Arwa Jamjoom 1, Manal Abdullah 2, Maysoon Abulkhair 3, Thoria Alghamdi 4, Aisha Mogbil 5 1,2,3,4,5
SMS-Based Alert Notification for Credit Applications Queuing Systems
International Journal of Innovation and Applied Studies ISSN 2028-9324 Vol. 9 No. 3 Nov. 2014, pp. 1291-1302 2014 Innovative Space of Scientific Research Journals http://www.ijias.issr-journals.org/ SMS-Based
10CS35: Data Structures Using C
CS35: Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C OBJECTIVE: Learn : Usage of structures, unions - a conventional tool for handling a
CS556 Course Project Performance Analysis of M-NET using GSPN
Performance Analysis of M-NET using GSPN CS6 Course Project Jinchun Xia Jul 9 CS6 Course Project Performance Analysis of M-NET using GSPN Jinchun Xia. Introduction Performance is a crucial factor in software
Data Structures. Chapter 8
Chapter 8 Data Structures Computer has to process lots and lots of data. To systematically process those data efficiently, those data are organized as a whole, appropriate for the application, called a
Simple Queuing Theory Tools You Can Use in Healthcare
Simple Queuing Theory Tools You Can Use in Healthcare Jeff Johnson Management Engineering Project Director North Colorado Medical Center Abstract Much has been written about queuing theory and its powerful
NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS
NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS D. Todinca, P. Perry and J. Murphy Dublin City University, Ireland ABSTRACT The goal of this paper
This lecture. Abstract data types Stacks Queues. ADTs, Stacks, Queues 1. 2004 Goodrich, Tamassia
This lecture Abstract data types Stacks Queues ADTs, Stacks, Queues 1 Abstract Data Types (ADTs) An abstract data type (ADT) is an abstraction of a data structure An ADT specifies: Data stored Operations
International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0047 ISSN (Online): 2279-0055 International
Intelligent Mobile Hospital Appointment Scheduling and Medicine Collection
Intelligent Mobile Hospital Appointment Scheduling and Medicine Collection Swabik Musa Abdulla Wani Computing and Information Systems Institut Teknologi Brunei Brunei Darussalam [email protected] Abstract
SIMULATION STUDY OF THE OPTIMAL APPOINTMENT NUMBER FOR OUTPATIENT CLINICS
ISSN 1726-4529 Int j simul model 8 (29) 3, 156-165 Professional paper SIMULATION STUDY OF THE OPTIMAL APPOINTMENT NUMBER FOR OUTPATIENT CLINICS Zhu, Z. C.; Heng, B. H. & Teow, K. L. Department of Health
Patient Appointment Reservation System
Patient Appointment Reservation System Vilnius 2008 Contents Introduction... 3 PARS in Lithuania... 4 System operation principles... 5 Advantages for patients... 5 Advantages for specialists... 6 Advantages
Queuing Theory. Long Term Averages. Assumptions. Interesting Values. Queuing Model
Queuing Theory Queuing Theory Queuing theory is the mathematics of waiting lines. It is extremely useful in predicting and evaluating system performance. Queuing theory has been used for operations research.
Performance Analysis of a Telephone System with both Patient and Impatient Customers
Performance Analysis of a Telephone System with both Patient and Impatient Customers Yiqiang Quennel Zhao Department of Mathematics and Statistics University of Winnipeg Winnipeg, Manitoba Canada R3B 2E9
PART III. OPS-based wide area networks
PART III OPS-based wide area networks Chapter 7 Introduction to the OPS-based wide area network 7.1 State-of-the-art In this thesis, we consider the general switch architecture with full connectivity
Revenue management based hospital appointment scheduling
ISSN 1 746-7233, England, UK World Journal of Modelling and Simulation Vol. 11 (2015 No. 3, pp. 199-207 Revenue management based hospital appointment scheduling Xiaoyang Zhou, Canhui Zhao International
The Joint Distribution of Server State and Queue Length of M/M/1/1 Retrial Queue with Abandonment and Feedback
The Joint Distribution of Server State and Queue Length of M/M/1/1 Retrial Queue with Abandonment and Feedback Hamada Alshaer Université Pierre et Marie Curie - Lip 6 7515 Paris, France [email protected]
CHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION
31 CHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION 3.1 INTRODUCTION In this chapter, construction of queuing model with non-exponential service time distribution, performance
Chapter 3 ATM and Multimedia Traffic
In the middle of the 1980, the telecommunications world started the design of a network technology that could act as a great unifier to support all digital services, including low-speed telephony and very
Course: Programming II - Abstract Data Types. The ADT Queue. (Bobby, Joe, Sue, Ellen) Add(Ellen) Delete( ) The ADT Queues Slide Number 1
Definition Course: Programming II - Abstract Data Types The ADT Queue The ADT Queue is a linear sequence of an arbitrary number of items, together with access procedures. The access procedures permit addition
Effective Utilization of Mobile Call Center Using Queuing Models
Effective Utilization of Mobile Call Center Using Queuing Models Osahenvemwen O. A. and Odiase O. F. Abstract This study presents effective utilization of mobile call center using queuing models. Aim at
TIME DEPENDENT PRIORITIES IN CALL CENTERS
TIME DEPENDENT PRIORITIES IN CALL CENTERS LASSAAD ESSAFI and GUNTER BOLCH Institute of Computer Science University of Erlangen-Nuremberg Martensstrasse 3, D-91058 Erlangen, Germany E-mail : [email protected],
Telephone Traffic Queues in a Customer Call Center. A Thesis. Presented for the. Master of Science Degree. The University of Tennessee at Chattanooga
Telephone Traffic Queues in a Customer Call Center A Thesis Presented for the Master of Science Degree The University of Tennessee at Chattanooga Patrick Todd April 2009 Copyright 2009 by Patrick Todd
1. Repetition probability theory and transforms
1. Repetition probability theory and transforms 1.1. A prisoner is kept in a cell with three doors. Through one of them he can get out of the prison. The other one leads to a tunnel: through this he is
STACKS,QUEUES, AND LINKED LISTS
STACKS,QUEUES, AND LINKED LISTS Stacks Queues Linked Lists Double-Ended Queues Case Study: A Stock Analysis Applet 1 Stacks Astack is a container of objects that are inserted and removed according to the
Automatic Queuing Model for Banking Applications
(IJASA) International Journal of Advanced omputer Science Applications, Vol., No., Automatic Queuing Model for Banking Applications Dr. Ahmed S. A. AL-Jumaily Department of Multimedia IT ollege, Ahlia
Modeling and Simulation Analysis of Health Care Appointment System using ARENA
ISSN 2278-3083 Volume 4, No.1, January - February 2015 Aliyu Isah Aliyu et al., International Journal of Science and Advanced Information Technology, 4 (1), January - February 2015, 01-07 International
A Group based Time Quantum Round Robin Algorithm using Min-Max Spread Measure
A Group based Quantum Round Robin Algorithm using Min-Max Spread Measure Sanjaya Kumar Panda Department of CSE NIT, Rourkela Debasis Dash Department of CSE NIT, Rourkela Jitendra Kumar Rout Department
LECTURE - 3 RESOURCE AND WORKFORCE SCHEDULING IN SERVICES
LECTURE - 3 RESOURCE AND WORKFORCE SCHEDULING IN SERVICES Learning objective To explain various work shift scheduling methods for service sector. 8.9 Workforce Management Workforce management deals in
What is a Stack? Stacks and Queues. Stack Abstract Data Type. Java Interface for Stack ADT. Array-based Implementation
Stacks and Queues What is a Stack? Stores a set of elements in a particular order Accessed in Last-In In-First-Out (LIFO) fashion Real life examples: Pile of books PEZ dispenser Cup trays in cafeteria
Appointment system. Objectives
Appointment system The appointment module is an electronic paperless application designed with high flexibility and ease of usage, implemented in single clinics and polyclinics. The system serves in managing
BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security. & BSc. (Hons.) Software Engineering
BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security & BSc. (Hons.) Software Engineering Cohort: BIS/05/FT BCNS/05/FT BSE/05/FT Examinations for 2005-2006 / Semester
Manufacturing Systems Modeling and Analysis
Guy L. Curry Richard M. Feldman Manufacturing Systems Modeling and Analysis 4y Springer 1 Basic Probability Review 1 1.1 Basic Definitions 1 1.2 Random Variables and Distribution Functions 4 1.3 Mean and
DEPENDABLE ONLINE APPOINTMENT BOOKING SYSTEM FOR NHIS OUTPATIENT IN NIGERIAN TEACHING HOSPITALS
DEPENDABLE ONLINE APPOINTMENT BOOKING SYSTEM FOR NHIS OUTPATIENT IN NIGERIAN TEACHING HOSPITALS Adebayo Peter Idowu1, Olajide Olusegun Adeosun2, and Kehinde Oladipo Williams3 1 2 Department of Computer
Process Modelling from Insurance Event Log
Process Modelling from Insurance Event Log P.V. Kumaraguru Research scholar, Dr.M.G.R Educational and Research Institute University Chennai- 600 095 India Dr. S.P. Rajagopalan Professor Emeritus, Dr. M.G.R
Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C
Tutorial#1 Q 1:- Explain the terms data, elementary item, entity, primary key, domain, attribute and information? Also give examples in support of your answer? Q 2:- What is a Data Type? Differentiate
Improving Cardiac Surgery Patient Flow through Computer Simulation Modeling
Improving Cardiac Surgery Patient Flow through Computer Simulation Modeling Dana Khayal, Fatma Almadhoun, Lama Al-Sarraj and Farayi Musharavati Abstract In this paper, computer simulation modeling was
TEACHING SIMULATION WITH SPREADSHEETS
TEACHING SIMULATION WITH SPREADSHEETS Jelena Pecherska and Yuri Merkuryev Deptartment of Modelling and Simulation Riga Technical University 1, Kalku Street, LV-1658 Riga, Latvia E-mail: [email protected],
MAT 183 - Elements of Modern Mathematics Syllabus for Spring 2011 Section 100, TTh 9:30-10:50 AM; Section 200, TTh 8:00-9:20 AM
MAT 183 - Elements of Modern Mathematics Syllabus for Spring 2011 Section 100, TTh 9:30-10:50 AM; Section 200, TTh 8:00-9:20 AM Course Instructor email office ext. Thomas John, Ph.D. [email protected] 224
Cloud FTP: A Case Study of Migrating Traditional Applications to the Cloud
Cloud FTP: A Case Study of Migrating Traditional Applications to the Cloud Pooja H 1, S G Maknur 2 1 M.Tech Student, Dept. of Computer Science and Engineering, STJIT, Ranebennur (India) 2 Head of Department,
BRAESS-LIKE PARADOXES FOR NON-COOPERATIVE DYNAMIC LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS
GESJ: Computer Science and Telecommunications 21 No.3(26) BRAESS-LIKE PARADOXES FOR NON-COOPERATIVE DYNAMIC LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS Said Fathy El-Zoghdy Department of Computer Science,
ANALYSIS OF THE QUALITY OF SERVICES FOR CHECKOUT OPERATION IN ICA SUPERMARKET USING QUEUING THEORY. Azmat Nafees Liwen Liang. M. Sc.
ANALYSIS OF THE QUALITY OF SERVICES FOR CHECKOUT OPERATION IN ICA SUPERMARKET USING QUEUING THEORY by Azmat Nafees Liwen Liang A C level essay in Statistics submitted in partial fulfillment of the requirements
LOAD BALANCING AS A STRATEGY LEARNING TASK
LOAD BALANCING AS A STRATEGY LEARNING TASK 1 K.KUNGUMARAJ, 2 T.RAVICHANDRAN 1 Research Scholar, Karpagam University, Coimbatore 21. 2 Principal, Hindusthan Institute of Technology, Coimbatore 32. ABSTRACT
Algorithms and Data Structures Written Exam Proposed SOLUTION
Algorithms and Data Structures Written Exam Proposed SOLUTION 2005-01-07 from 09:00 to 13:00 Allowed tools: A standard calculator. Grading criteria: You can get at most 30 points. For an E, 15 points are
The Affects of Different Queuing Algorithms within the Router on QoS VoIP application Using OPNET
The Affects of Different Queuing Algorithms within the Router on QoS VoIP application Using OPNET Abstract: Dr. Hussein A. Mohammed*, Dr. Adnan Hussein Ali**, Hawraa Jassim Mohammed* * Iraqi Commission
PFS scheme for forcing better service in best effort IP network
Paper PFS scheme for forcing better service in best effort IP network Monika Fudała and Wojciech Burakowski Abstract The paper presents recent results corresponding to a new strategy for source traffic
Fluid Approximation of a Priority Call Center With Time-Varying Arrivals
Fluid Approximation of a Priority Call Center With Time-Varying Arrivals Ahmad D. Ridley, Ph.D. William Massey, Ph.D. Michael Fu, Ph.D. In this paper, we model a call center as a preemptive-resume priority
Office Efficiency. Barbara Tauscher, MHA, FACMPE Director of Operations The Oregon Clinic GI South Portland, Oregon
Office Efficiency Barbara Tauscher, MHA, FACMPE Director of Operations The Oregon Clinic GI South Portland, Oregon Introduction-Why this Topic? The Oregon Clinic GI Division, 3 separate GI practices working
HW3: Programming with stacks
HW3: Programming with stacks Due: 12PM, Noon Thursday, September 18 Total: 20pts You may do this assignment with one other student. A team of two members must practice pair programming. Pair programming
1. Implementation of a testbed for testing Energy Efficiency by server consolidation using Vmware
1. Implementation of a testbed for testing Energy Efficiency by server consolidation using Vmware Cloud Data centers used by service providers for offering Cloud Computing services are one of the major
CS104: Data Structures and Object-Oriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team
CS104: Data Structures and Object-Oriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team Lecture Summary In this lecture, we learned about the ADT Priority Queue. A
CURRENT wireless personal communication systems are
Efficient Radio Resource Allocation in a GSM and GPRS Cellular Network David E Vannucci & Peter J Chitamu Centre for Telecommunications Access and Services School of Electrical and Information Engineering
Module 2 Stacks and Queues: Abstract Data Types
Module 2 Stacks and Queues: Abstract Data Types A stack is one of the most important and useful non-primitive linear data structure in computer science. It is an ordered collection of items into which
Christ Missionary & Industrial College (High School) Steps To Admission
Christ Missionary & Industrial College (High School) Steps To Admission For Students Entering Day Care Twelfth Grade Requirements of Parents 1. Read carefully through this material, 1. C. M. & I. School
6.263/16.37: Lectures 5 & 6 Introduction to Queueing Theory
6.263/16.37: Lectures 5 & 6 Introduction to Queueing Theory Massachusetts Institute of Technology Slide 1 Packet Switched Networks Messages broken into Packets that are routed To their destination PS PS
Exponential Approximation of Multi-Skill Call Centers Architecture
Exponential Approximation of Multi-Skill Call Centers Architecture Ger Koole and Jérôme Talim Vrije Universiteit - Division of Mathematics and Computer Science De Boelelaan 1081 a - 1081 HV Amsterdam -
How do I provide patients with access to Instant Medical History?
Practice Partner Instant Medical History Product Bulletin Instant Medical History is a patient interview software application created by Primetime Medical Software, Inc. Practice Partner has partnered
Network and Capacity Planning in SURFnet6
Network and Capacity Planning in SURFnet6 Ronald van der Pol 1 and Freek Dijkstra 1 SARA Computing & Networking Services, Kruislaan 415, 1098 SJ Amsterdam, The Netherlands [email protected],[email protected]
MODELING OF SYN FLOODING ATTACKS Simona Ramanauskaitė Šiauliai University Tel. +370 61437184, e-mail: [email protected]
MODELING OF SYN FLOODING ATTACKS Simona Ramanauskaitė Šiauliai University Tel. +370 61437184, e-mail: [email protected] A great proportion of essential services are moving into internet space making the
1.00 Lecture 35. Data Structures: Introduction Stacks, Queues. Reading for next time: Big Java: 15.1-15.3. Data Structures
1.00 Lecture 35 Data Structures: Introduction Stacks, Queues Reading for next time: Big Java: 15.1-15.3 Data Structures Set of reusable classes used in algorithms, simulations, operating systems, applications
Waiting Lines and Queuing Theory Models
1 5 Waiting Lines and Queuing Theory Models 5.1 Introduction Queuing theory is the study of waiting lines. It is one of the oldest and most widely used quantitative analysis techniques. Waiting lines are
A Multiple Access Protocol for Multimedia Transmission over Wireless Networks
A Multiple Access Protocol for Multimedia Transmission over Wireless Networks Hong Yu and Mohammed Arozullah Department of Electrical Engineering and Computer Science Capitol College, Maryland, USA [email protected]
AS-D1 SIMULATION: A KEY TO CALL CENTER MANAGEMENT. Rupesh Chokshi Project Manager
AS-D1 SIMULATION: A KEY TO CALL CENTER MANAGEMENT Rupesh Chokshi Project Manager AT&T Laboratories Room 3J-325 101 Crawfords Corner Road Holmdel, NJ 07733, U.S.A. Phone: 732-332-5118 Fax: 732-949-9112
