Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
19,748
result(s) for
"Queuing"
Sort by:
QUANTIFYING FAIRNESS IN QUEUING SYSTEMS
In this article we discuss fairness in queues, view it in the context of social justice at large, and survey the recently published research work and publications dealing with the issue of measuring fairness of queues. The emphasis is placed on the underlying principles of the different measurement approaches, on reviewing their methodology, and on examining their applicability and intuitive appeal. Some quantitative results are also presented. The article has three major parts (sections) and a short concluding discussion. In the first part we discuss fairness in queues and its importance in the broader context of the prevailing conception of social justice at large, and the distinction between fairness of the queue and fairness at large is illuminated. The second part is dedicated to explaining and discussing three main properties expected of a fairness measure: conformity to the general concept of social justice, granularity, and intuitive appeal and rationality. The third part reviews the fairness of the queue evaluating and measuring approaches proposed and studied in recent years. We describe the underlying principles of the different approaches, present some of their results, and review them in context of the three main properties expected from a measure. The short discussion that follows centers on future research issues.
Journal Article
An overview of queuing delay and various delay based algorithms in networks
In the era of modern technology, the demand for seamless and fast communication service is gradually increasing. Moreover, as time goes on, more devices are getting connected to the network. In the vast network, for quick responses to these devices, the delay becomes one of the important factors to concern about. Among different types, Queuing delay causes more impact on a network compared to other delays. A survey on delay, different models, effects, and management are illustrated here. Queuing models, like Little Theorem, M/M/1, M/M/m, M/G/1, etc, are discussed in detail. We move on explaining the delay effects on different types of the network such as Wireless network, Mobile communication network, SDN, IoT, etc. This paper also focuses on TCP/IP fields like ECN bits, MPLS, and characteristics of flows. Lastly, the effects of delay on other related networking are discussed.
Journal Article
Performance modeling and design of computer systems : queueing theory in action
\"Computer systems design is full of conundrums. Tackling the questions that systems designers care about, this book brings queueing theory decisively back to computer science. The book is written with computer scientists and engineers in mind and is full of examples from computer systems, as well as manufacturing and operations research. Fun and readable, the book is highly approachable, even for undergraduates, while still being thoroughly rigorous and also covering a much wider span of topics than many queueing books. Readers benefit from a lively mix of motivation and intuition, with illustrations, examples and more than 300 exercises - all while acquiring the skills needed to model, analyze and design large-scale systems with good performance and low cost. The exercises are an important feature, teaching research-level counterintuitive lessons in the design of computer systems. The goal is to train readers not only to customize existing analyses but also to invent their own\"-- Provided by publisher.
Book
OPTIMAL NO. OF CREW IN A WORKSHOP SUBJECT TO MINIMIZE THE TOTAL COST
Objetivo: O principal objetivo deste artigo é determinar o número ideal, de homens técnicos em urna equipe de oficina de um Sistema Industrial. Referencia! teórico: O objetivo da aplicaçao dessas ferramentas é explorar sua capacidade de reduçao de custos e melhorias que podem ser obtidas no processo de prestaçao de serviços ao cliente final. Desenho/metodologia/abordagem: A revisão da estrutura da literatura foi construida a partir da análise de 12 artigos científicos e livros, de ciencias da web e da base de dados Elsevier. Os artigos foram analisados a partir de características descritivas, metodológicas e de citaçâo. Descoberta: Aplicando o modelo de equaçâo do papel, o nao ideal, de homens técnicos na tripulaçao da oficina pode ser determinado quando atende aos menores custos totais de custo operációnál e custo de técnicos levando em consideraçâo a taxa de chegada e a taxa de serviço. Implicaçâo prática e social da pesquisa: Os dados examinados neste artigo assumem o número de técnicos a partir do número que torna a medida de desempenho lógica e aceitável. Originalidade/valor: O artigo é urna pesquisa académica, voltada para a aplicaçao da teoría das filas principalmente a decisâo multi-servidor, onde pode levar a urna melhor decisao de manutençao.
Journal Article
Optimization of rental systems : queuing loss theory for the optimization of cargo vehicle rental systems
Logistics providers typically own large fleets of transportation vehicles such as rail cars or trucks. These fleets do not only determine to a large extent the service level the company can offer, but also make up a large part of total costs. Proper management of the fleet is therefore a crucial factor for these companies. In this book the author presents planning approaches that address the optimal management of vehicle fleets. Firstly, methods for determining the mixture of vehicle types and the optimal size of a fleet are developed. Secondly, approaches for supporting new service models such as customer segmentation are derived. Potential readership includes scholars and graduate students who are interested in the field of fleet planning and practitioners from logistics companies looking for new planning approaches.
BOOK
Modeling, Analysis, and Design Insights for Shuttle-Based Compact Storage Systems
Shuttle-based compact systems are new automated multideep unit-load storage systems with lifts that can potentially achieve both low operational cost and large volume flexibility. In this paper, we develop novel queuing network models to estimate the performance of both single-tier and multitier shuttle-based compact systems. Each tier is modeled as a multiclass semi-open queuing network, whereas the vertical transfer is modeled using an open queue. For a multitier system, the models corresponding to tiers and vertical transfer are linked together using the first and second moment information of the queue departure processes. The models can handle both specialized and generic shuttles and both continuous and discrete lifts. The accuracy of the models is validated through both simulation and a real case. Errors are acceptable for conceptualizing initial designs. Numerical studies provide new design insights. Results show that the best way to minimize expected throughput time in single-tier systems is to have a depth/width ratio around 1.25. Moreover, specialized shuttles are recommended for multitier systems because the higher cost of generic shuttles is not balanced by savings in reduced throughput time and equipment needs.
Journal Article
Operating Policies in Robotic Compact Storage and Retrieval Systems
Robotic compact storage and retrieval systems (RCSRS) have seen many implementations over the last few years. In such a system, the inventory items are stored in bins, organized in a grid. In each cell of the grid, a certain number of bins are stored on top of each other. Robots with transport and lifting capabilities move on the grid roof to transport bins between manual workstations and storage stacks. We estimate performance and evaluate storage policies of RCSRS, considering both dedicated and shared storage policies coupled with random and zoned storage stacks. Semi-open queuing networks (SOQNs) are built to estimate the system performance, which can handle both immediate and delayed reshuffling processes. We approximate the models by reduced SOQNs with two load-dependent service nodes and use the matrix-geometric method to solve them. Both simulations and a real case are used to validate the analytical models. Assuming a given number of stored products, our models can be used to optimize not only the length-to-width ratio of the system but also the stack height, depending on the storage strategy used. For a given inventory and optimal system configuration, we demonstrate that the dedicated storage policy outperforms the shared storage policy when the objective is to minimize dual command throughput time. However, from a cost perspective, with a maximum dual command throughput time as a constraint, we show that shared storage substantially outperforms dedicated storage. The annualized costs of dedicated storage are up to twice as large as those of shared storage, as a result of the larger number of storage positions required by dedicated storage and the relatively lower filling degree of storage stacks.
The online appendix is available at
https://doi.org/10.1287/trsc.2017.0786
.
Journal Article