Dynamic Scheduling Of A Multiclass Make To Stock Queue

Dynamic Scheduling of a Multiclass Make-To-Stock Queue

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work. As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.

Dynamic Scheduling of a Multiclass Make-to-Stock Queue (Classic Reprint)

Excerpt from Dynamic Scheduling of a Multiclass Make-to-Stock Queue Motivated by make-to-stock production systems, we consider a scheduling problem for a single-server queue that can process a variety of different job classes. After jobs are processed, they enter a finished goods inventory that services customer demand. The scheduling problem is to release jobs to the queue and decide which job class, if any, to serve next in order to minimize the long run expected average cost incurred per unit of time, which includes linear costs (which may differ by class) for backordering finished goods inventory, holding finished goods inventory, and holding Wip inventory. Under the heavy traffic condition that the server must be busy the great majority of the time in order to satisfy customer demand, the scheduling problem is approximated by a dynamic control problem involving Brownian motion. The Brownian control problem is solved, and its solution is interpreted in terms of the queueing system in order to obtain an effective scheduling policy. The proposed scheduling policy releases jobs to the queue only when they are about to begin processing, and keeps the server busy as long as the weighted sum of the finished goods inventory (where the inventory of each class is weighted by its expected processing time) is not too large. When the server is working, priority is given to backlogged classes that are expensive to backlog and have short expected processing times, and when there are no backlogged jobs, priority is given to jobs that are inexpensive to hold in finished goods inventory and have long expected processing times. 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.

Optimal Dynamic Scheduling Policy for a Make-to-stock Production System