Dynamic Scheduling of a Two-Class Queue with Setups (Classic Reprint)

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.