Aarti Saini

Este livro uma tentativa de analisar os modelos de rede de filas bi-seriais com a disciplina de Prioridade. Os modelos de filas de espera propostos foram analisados em ambiente estoc stico. As equa es de Chapman-Kolmogorov (CKE) s o utilizadas para definir as distribui es de probabilidade conjuntas com probabilidades associadas e satisfazem todas as condi es necess rias para a exist ncia de solu es independentes do tempo num processo estoc stico. O presente estudo til para reduzir os congestionamentos e o per odo de inatividade dos sistemas de servi o. A aplicabilidade do estudo encontra-se nos sectores banc rio, m dico, dos registos e das administra es e em muitos outros dom nios em que os visitantes de alta prioridade recebem tratamento especial em rela o aos visitantes comuns (baixa prioridade).

Ce livre est une tentative d'analyse des mod les de r seaux de files d'attente bi-s riels avec la discipline des priorit s. Les mod les de file d'attente propos s ont t analys s dans un environnement stochastique. Les quations de Chapman-Kolmogorov (CKE) sont utilis es pour d finir les distributions de probabilit conjointes avec les probabilit s associ es et satisfont toutes les conditions requises pour l'existence de solutions ind pendantes du temps dans un processus stochastique. La pr sente tude est utile pour r duire les encombrements et les p riodes d'inactivit des syst mes de service. Elle trouve son application dans les secteurs bancaire, m dical, des inscriptions et des administrations et dans bien d'autres domaines, en partant du principe que les visiteurs hautement prioritaires b n ficient d'un traitement sp cial par rapport aux visiteurs ordinaires (faiblement prioritaires).

Questo libro un tentativo di analizzare i modelli di rete di code bi-seriali con la disciplina delle priorit . I modelli di coda proposti sono stati analizzati in ambiente stocastico. Le equazioni di Chapman-Kolmogorov (CKE) sono utilizzate per definire le distribuzioni di probabilit congiunte con le probabilit associate e soddisfano tutte le condizioni richieste per l'esistenza di soluzioni indipendenti dal tempo in un processo stocastico. Il presente studio utile per ridurre le congestioni e i periodi di inattivit dei sistemi di servizio. L'applicabilit dello studio si riscontra nei settori bancario, medico, delle registrazioni e delle amministrazioni e in molti altri campi in cui si ipotizza che i visitatori ad alta priorit ricevano un trattamento speciale rispetto ai visitatori comuni (a bassa priorit ).

Dieses Buch ist ein Versuch, die bi-seriellen Warteschlangennetzwerkmodelle mit Priorit tsdisziplin zu analysieren. Die vorgeschlagenen Warteschlangenmodelle wurden in einer stochastischen Umgebung analysiert. Die Chapman-Kolmogorov-Gleichungen (CKE) werden verwendet, um die gemeinsamen Wahrscheinlichkeitsverteilungen mit den zugeh rigen Wahrscheinlichkeiten zu definieren und alle erforderlichen Bedingungen f r die Existenz von zeitunabh ngigen L sungen in stochastischen Prozessen zu erf llen. Die vorliegende Studie ist n tzlich, um berlastungen und Leerlaufzeiten von Verkehrssystemen zu reduzieren. Die Anwendbarkeit der Studie findet sich im Bankensektor, im medizinischen Bereich, bei Registrierungen und Verwaltungen und in vielen anderen Bereichen, in denen die Annahme besteht, dass Besucher mit hoher Priorit t eine besondere Behandlung gegen ber den gew hnlichen Besuchern (mit niedriger Priorit t) erfahren.

Queuing theory have wide range of applications that helps a person in making right decision in complex queuing system encountered in daily life. Queuing theory deals with the study of queues that occurs in real world situations and arise when the rate of arrival exceeds the rate of service. The capacity of a particular system can be determined by queueing theory based on the probability idea. A method of optimization cannot be used to describe the application of queueing theory. It aids in making the best possible use of the currently available staff and other resources to enhance the service. As a result of the unfavorable experiences of waiting for service, customers become dissatisfied and may migrate to other service providers. The cost of waiting is both psychological and financial, because waiting time implies the loss of a valuable resources. Customer dissatisfaction increases as the wait time increases.This book provides a stochastic analysis of a priority bi-tandem queue network of two parallel biserial subsystems commonly connected to a single server. This analytical study is not limited to a specific situation, but has numerous applications in networking system, supermarket, administrations, industries etc. This study is useful to increase customer's satisfaction and optimum utilizations of the serving facilities. Numerical and Graphical analysis of the study is helpful to those, who are interested to analyze the complex Priority queue system in stochastic environment.