Accession Number:

ADA278495

Title:

An Efficient Approach to Solving the Optimal Control of Arrivals Problem

Descriptive Note:

Master's thesis

Corporate Author:

AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING

Personal Author(s):

• Simeoni, John R.

Report Date:

1994-03-01

Pagination or Media Count:

55.0

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. Optimal control of arrivals, Planning arrivals, Scheduling Theory, Queueing theory, Control of queues.

Descriptors:

• *QUEUEING THEORY
• *SCHEDULING
• *LOGISTICS PLANNING
• ALGORITHMS
• CONTROL
• PROBABILITY DISTRIBUTION FUNCTIONS
• SLOTS
• ARRIVAL
• COMPUTER AIDED INSTRUCTION
• THESES
• FINITE ELEMENT ANALYSIS
• TIME DEPENDENCE
• OPTIMIZATION

Subject Categories:

• Operations Research
• Logistics, Military Facilities and Supplies

Distribution Statement:

APPROVED FOR PUBLIC RELEASE