Date of Award

3-1994

Document Type

Thesis

Degree Name

Master of Science

Department

Department of Operational Sciences

First Advisor

Dennis C. Dietz, PhD

Abstract

The optimal control of arrivals problem is one which has many applications in both defense and industry. Simply stated, the problem addresses how to schedule a finite number of customers in a finite number of equal length time slots, where each customers service time comes from a specified probability distribution. There are two cost components, one based on total expected customer waiting time and the other based m the expected amount of time the server stays open beyond its scheduled completion time. Currently, solutions have been developed to the optimal control of arrivals problem, but they are computationally slow and only work for exponential distributions. This thesis presents an algorithm for the optimal control of arrivals problem which is both computationally efficient and works for r-Erlang distributions.

AFIT Designator

AFIT-GOR-ENS-94M-14

DTIC Accession Number

ADA278495

Comments

The author's Vita page is omitted.

Download

Share

COinS