Excerpt from Scheduling a Two-Station Multiclass Queueing Network in Heavy Traffic
The queueing network model can also accomodate machine breakdown and repair. By assuming that the amount of machine busy time between consecutive breakdowns is exponentially distributed, the breakdown and repair can be incorporated into the service time distributions for each customer class; see Harrison [4] for details. The modified rm and sf, are interpreted as the mean and variance of the effective service time of a class k.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Forgotten Books, London, Vereinigtes Königreich
Paperback. Zustand: New. Print on Demand. This book explores a dynamic control problem arising in determining input and sequencing decisions in a two-station multiclass queueing network. The author's solution to this problem is based on insights gleaned from Brownian network theory, which involves approximating a multiclass queueing network with a stochastic system model under balanced heavy loading conditions. In the context of the book's broader industrial engineering context, this scheduling problem is relevant to manufacturing environments where the objective is to optimally manage the flow of jobs through a network of machines. The author's proposed strategy, which prioritizes sequencing based on an index combining customer class, service times, and server utilizations, is shown to minimize average cycle time and maximize throughput. This book significantly contributes to the existing body of knowledge on scheduling in queueing networks, particularly in heavy traffic conditions. Its findings have practical implications for production planning in various industries, including manufacturing, where minimizing cycle time and maximizing throughput are crucial for efficiency and profitability. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Bestandsnummer des Verkäufers 9780365647829_0
Anzahl: Mehr als 20 verfügbar
Anbieter: PBShop.store US, Wood Dale, IL, USA
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9780365647829
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9780365647829
Anzahl: 15 verfügbar