基于SPCE061A的医院排队叫号系统设计与实现

排队叫号系统广泛应用于医院、银行等服务性部门。在现有的医院信息系统(HIS)的基础上,由SPCE061A作为主控芯片,结合取号器、排队主机、大厅LED显示屏、窗口LED显示屏、键盘输入及语音播报等部分构成排队叫号系统的硬件,通过软件编程,完成取号、身份识别、自动叫号、动态数据监控和效率管理等功能从而实现自动排队,有效地解决了医院的排队拥挤现象和插队的问题,改善了就诊流程,提高了工作效率,从而提升了医院的信息化水平和服务质量。     

带优先权与不耐烦顾客排队模型的模拟仿真

考虑一个有两类顾客到达的单服务台的排队系统。两类顾客的到达过程均为泊松过程,第一类顾客较第二类顾客具有强占优先权,且第二类顾客由于第一类顾客的到达而变得不耐烦,其＂耐性时间＂服从负指数分布。两类顾客的服务时间服从相同参数的负指数分布,服务规则是强占优先服务,在高负荷条件下用Matlab编程对此排队系统进行模拟仿真,为处理此类排队问题提供了一个新方法。     

智能排队信息系统

本文研究采用图像识别技术实现排队信息查询系统。该系统通过采集当前排队通道的照片或视频,识别排队队列的人数,并计算队列的前进速率、排队时长、队伍人数变化速度和平均排队人数。同时,系统还能存储、记录和保存识别计算结果,并预测当天的最佳时间段、预测总排队时长和预测排队总人数。用户可以通过查询该系统获取排队信息,包括查询队列的人数、队列的前进速率、排队时长、队伍人数变化速度、平均排队人数、最佳时间段、预测总排队时长、预测排队总人数以及用户自身排队记录。通过该系统自动预估排队信息,用户能实时了解最佳的排队时机。     

离散时间闸门式多级门限服务的两级优先级轮询排队系统分析

本文提出了一种基于闸门式多级门限服务的两级优先级轮询系统.论文先构建了系统的排队分析模型,然后把模型中各个站点内的等待顾客数合起来设定为系统状态变量,对系统状态变量的概率母函数求二阶偏导后组成迭代方程组,联立求解后得到了站点的平均排队队长、顾客平均等待时间以及服务器查询周期等关键指标的完整数学解析表达式.最后,对该模型进行了仿真实验分析,实验结果与理论结果相一致.系统性能分析表明该轮询系统满足了周期性系统服务资源分配过程中业务多样性和弹性服务的发展需求,使得轮询控制策略应用方面更为广泛.     

超市收费排队系统的性能比较及其进一步优化

详细统计了超市顾客的到达速率和顾客能接受的最大排队队长及最长等待时间,并了解了超市针对市场竞争采取的排队规定和措施,利用排队论的有关知识分析超市收银系统的特点,建立超市收银系统的数学模型,通过求解数学模型,得到模型的最优解决方案,最后针对超市收银系统的不足,对超市收银系统进行了改进。     

两类周期查询式完全服务排队系统研究

本文对时间连续型非对称周期查询式完全服务排队系统进行了分析,并与时间离散型周期查询式完全服务排队系统(赵东风,1994)进行了对比研究。在两种系统取相同的系统参数值的条件下,给出两类排队服务系统的分析结果。     

双CPU红外亚成像系统“自举”的实现

论述了对红外亚成像目标识别随机系统服务建立的有优先权服务的等待制排队系统模型。基于高优先权队伍的排队机制，提出了随机服务系统“自举”实现的设计思想。详述了中央处理机（CPLD）为完成主、从C50资源共享，采用的逻辑、时序控制原理。实验结果表明，该随机服务系统能自动引导装入程序，成功“自举”。     

两类周期查询式完全服务排队系统研究

本文对时间连续型非对称周期查询式完全服务排队系统进行了分析,并与时间离散型周期查询式完全服务排队系统（赵东风,１９９４）进行了对比研究。在两种系统取相同的系统参数值的条件下,给出两类排队服务系统的分析结果。     

医院门诊电子排队管理系统的建设

医院门诊的电子排队系统通过取号、自动叫号、身份识别与数据监测等方法,有效的解决了患者就医过程中出现的排队混乱和拥挤等问题,并为医院就诊创设一种和谐、宽松的氛围。本文分析了医院门诊电子排队管理系统的建设,及门诊排队系统的实施方案,旨在提升医院的服务质量水平。     

银行叫号手机排队系统解决方案

随着银行业务的不断发展,出现了人们对于银行排队服务的日益不满,对此,项目组在基于当前银行叫号排队系统的基础上,设计了银行叫号手机排队系统,该系统是为了满足广大储户办理存取款业务,实现方便快捷排队的需求而设计的一套无纸化、网络化、智能化的信息系统.储户不必到营业厅现场即可通过无线网络实现排队；通过向储户反馈相关网点排队人数而提醒储户选择离自己较近的并且排队人数较少的网点进行排队,以此来减少储户在银行营业厅排队办理业务时白白浪费的时间,极大的方便了银行存蓄用户,合理分化了排队人流.     

Optimum alternatives of tandem G/G/K queues with disaster customers and retrial phenomenon: interactive voice response systems

In this paper, we study a tandem queue with retrials where the queue experiences disasters. The probability of system failure depends on the strength of equipment, which makes servers idle and causes the removal of all customers in queues and service areas at once. The customers in the queue are forced to orbit in a retrial queue during the system failure where they decide whether or not to come back to the system. Reducing the disaster arrival rate (the probability of system failure) by employing more servers and reducing the number of lost customers is very costly. Moreover, it is important to service the customers with no interruption and reduce the time in system. The developed scenarios are compared in five dimensions including time in system, cost of lost customer, operator cost, the number of uninterrupted service customers and cost of reducing disaster arrival rate (or empowering system cost). The scenarios are modeled by computer simulation. Then, the optimal scenario is chosen using data envelopment analysis. The optimal scenario maximizes system efficiency in terms of disaster arrival rate, cost of lost customers and the number of satisfied customers. In the main problem, the disasters arrive at the system according to Poisson process; the effect of changing the distribution function of disaster arrival has been investigated finally. We are among the first ones to study and optimize G/G/K tandem queuing systems with system failures and retrial phenomena in interactive voice response systems.     

A system where the number of servers changes depending on the queue length

In this note, the system is analyzed in the steady state by assuming that the number of servers change depending on the queue length. In the case of two servers, it is assumed that the service abilities of each server differ. The mean number of customers in the system and the mean queue length of customers are derived as the characteristic values of the system.     

Stationary characteristics of MX/M/1 systems with two-speed service

An M^X/M/1 queueing system with threshold switching of service regimes at the instant of a change in the number of customers and the same system with threshold blocking of the flow of customers are considered. For these systems, an algorithm is proposed for determination of the stationary distribution of the number of customers and stationary characteristics (the mean queue length, the mean time of waiting in a queue, the variance of the queue length, the probability of the customer service for a system with blocking). For the case when the minimal number of incoming customers in a group is comparable with threshold value h, the stationary characteristics are found in an explicit form. For the system with threshold switching of service regimes (without blocking), two problems of optimal synthesis are solved. In these problems, the optimal values of threshold h and of the service intensity in the post-threshold regime are determined. The obtained results are verified with the help of simulation models developed with the help of the GPSS World software.     

Stationary characteristics of MX/M/1 systems with hysteretic switching of the service intensity

An M^X/M/1 queueing system with two-threshold hysteretic switching of the service intensity at the instants when the number of customers exceeds h ₂ and, then, decreases to the value h ₁ < h ₂ and the same system with the threshold locking of a flow of customers are considered. An algorithm is proposed for determination of the stationary distribution of the number of customers and stationary characteristics (the mean queue length, the mean time of waiting in a queue, the variance of the queue length, and the probability of the service of a customer for the system with blocking). Restrictions are imposed on the distribution of the number of incoming customers in a group to facilitate the determination of the stationary characteristics in an explicit form. The results are verified with the help of simulation models developed with the use of the GPSS World tools.     

Stationary characteristics of an M 2 X /M/n queue with hysteretic control of the input flow intensity

A multichannel queueing system with an unlimited queue length is considered. In the system, the service time and time intervals between arrivals of customer batches are characterized by exponential distributions and a hysteretic mechanism is applied to control the input flow intensity. The system receives two independent types of flows of customers one of which is blocked in the overload mode. An algorithm for determination of the stationary distribution of the number of customers and the stationary characteristics (the mean queue length, the mean time of waiting in the queue, the probability of a loss of customers) is proposed. The obtained results are verified with the help of a simulation model developed with the help of the GPSS World tools.     

Optimal synthesis problems for Markovian queueing systems with several given characteristics

For an M/M/1/r queueing system and an M/M/1 system with threshold switching of service modes at the instant of the change in the number of customers as well as for the same system with threshold blocking of the flow of customers, the monotonic dependence of stationary characteristics (the mean number of serviced customers per unit time, the mean service cost per unit time, the probability of system downtime, and the mean waiting time of a customer in the queue) on the system parameters (the buffer size, the system usage, and the threshold of switching between the service modes) is used to solve the optimal synthesis problems for systems with several given stationary characteristics. The solution of a particular optimal synthesis problem is the optimum value of one of the above parameters.     

The BMAP/G/1 Queue with Level-Dependent Arrivals – An Overview

The BMAP/G/1 queue is a field of intensive research since several years. We generalize the BMAP/G/1 queue by allowing the arrival process to depend on the state (level) of the queue, i.e., on the number of customers in the system. This will be called a BMAP/G/1 queueing system with level-dependent arrivals. A suitable arrival process is defined by nesting a countable number of BMAPs.We give conditions for the level-dependent BMAP/G/1 queue to be stable, i.e., in equilibrium. By analysing the fundamental periods, which now depend on their starting level, we determine the stationary queue length at service completion times and at an arbitrary time.     

Required Work in the M/M/1 Queue,with Application in IP Packet Processing

We consider the ordinary M/M/1 queue with the FIFO queueing discipline. It seems that the sum of service times of the customers in the system (or the required work, as we call it briefly) is a random variable that is not considered before. In this paper we derive the equilibrium distribution of this variable. The task is not quite trivial because of the dependencies between the elapsed service time and the number of customers in the system. Our motivation for this problem comes from the performance analysis of a dynamic memory allocation scheme of a packet buffer.     

The M/G/1 queue with permanent customers

The authors examine an M/G/1 FCFS (first come, first served) queue with two types of customers: ordinary customers, who arrive according to a Poisson process, and permanent customers, who immediately return to the end of the queue after having received a service. The influence of the permanent customers on queue length and sojourn times of the Poisson customers is studied using results from queuing theory and from the theory of branching processes. In particular, it is shown that, when the service time distributions of the Poisson customers and all K permanent customers are negative exponential with identical means, the queue length and sojourn time distributions of the Poisson customers are the (K+1)-fold convolution of those for the case without permanent customers