A Policy and Lower Bound for Scheduling Appointments (Classic Reprint)

Angebote / Angebote:

Excerpt from A Policy and Lower Bound for Scheduling Appointments In Section 3 of this paper, we construct a suboptimal scheduling policy by iteratively calculating the probability distribution of a patient's service completion time and then de riving a myopically optimal appointment time for the next patient. Dynamic programming is employed in Section 4 to derive a lower bound on the optimal objective function value for the scheduling problem. In Section 5, we repeat a portion of Ho and Lau's simulation study, and compare their eight rules to both the proposed scheduling policy and the lower bound. 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.