An Efficient Approach to Solving the Optimal Control of Arrivals Problem

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 customer's 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1994
Accession Number
ADA278495

Entities

People

  • John R. Simeoni

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Bibliographies
  • Cargo Handling
  • Clustering
  • Computer Programming
  • Customer Services
  • Dynamic Programming
  • Engineering
  • Intervals
  • Iterations
  • Literature Surveys
  • Operations Research
  • Plastic Explosives
  • Probability
  • Scheduling (Production)
  • Sequences
  • Time Intervals

Readers

  • Defense Acquisition Program Management
  • Mathematical Modeling and Probability Theory.