This book analyzes scheduling problems for a single-server queueing system with two classes of customers. Each class possesses its own arrival process, service time distribution, and holding cost rate. When switching from one class to another, the server incurs a setup cost or time. The author approximates the dynamic scheduling problems by diffusion control problems under heavy traffic assumptions and derives insights into the optimal policy. Computational results demonstrate the effectiveness of the proposed scheduling policy. This book contributes to the understanding of scheduling problems in queueing systems and provides valuable insights for researchers and practitioners in the fields of operations research, queueing theory, and computer science.
"Sinopsis" puede pertenecer a otra edición de este libro.
Excerpt from Dynamic Scheduling of a Two-Class Queue With Setups
Hence, if) is the largest value of the total workload for which class 2 is served exhaustively. Notice that w 00 when A 0, and so the Optimal control in the balanced case is a: for all r, which corresponds to exhaustive service for class 2.
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.
Excerpt from Dynamic Scheduling of a Two-Class Queue With Setups
We analyze two scheduling problems for a queueing system with a single server and two customer classes. Each class has its own renewal arrival process, general service time distribution and holding cost rate. In the first problem, a setup cos is incurred when the server switches from one class to the other, and the objective is to minimize the long run expected average cost of holding customers and incurring setups. The setup cost is replaced by a setup time in the second problem, where the objective is to minimize the average holding cost. By assuming that the queueing system operates under standard heavy traffic conditions, we approximate the dynamic scheduling problems by diffusion control problems. For both problems, considerable insight is gained into the nature of the optimal policy, and the computational results show that the proposed scheduling policy is within several percent of optimal over a broad range of problem parameters.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Forgotten Books, London, Reino Unido
Paperback. Condición: New. Print on Demand. This book analyzes scheduling problems for a single-server queueing system with two classes of customers. Each class possesses its own arrival process, service time distribution, and holding cost rate. When switching from one class to another, the server incurs a setup cost or time. The author approximates the dynamic scheduling problems by diffusion control problems under heavy traffic assumptions and derives insights into the optimal policy. Computational results demonstrate the effectiveness of the proposed scheduling policy. This book contributes to the understanding of scheduling problems in queueing systems and provides valuable insights for researchers and practitioners in the fields of operations research, queueing theory, and computer science. 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. Nº de ref. del artículo: 9781332258833_0
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332258833
Cantidad disponible: 15 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332258833
Cantidad disponible: 15 disponibles