A Queueing Network Approach to a Crew Scheduling Problem.

Abstract

The following optimization problem is considered; airplanes fly on prescribed routes and are flown by crews who must be rested after the passage of a certain interval of flying time. Rested crews who are stationed at bases on the routes can be deployed to keep the planes in flight. For a prescribed number of planes and crews, it is desired to place the crews at bases such that the amount of time spent by the planes in the air is a maximum. This paper investigates the use of a queueing network model as a means of formulating the optimization problem. Upper and lower bounds are presented for the expected fraction of time planes are airborne. These bounds may be useful in solving the optimization problem by means of a simulation model. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1980
Accession Number
ADA092834

Entities

People

  • Arnold L. Sweet

Organizations

  • United States Air Force School of Aerospace Medicine

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Aerospace Medicine
  • Air Force
  • Air Force Facilities
  • Aircrafts
  • Airplanes
  • Classification
  • Engineering
  • Government Procurement
  • Manufacturing
  • Mathematical Models
  • Models
  • New York
  • Optimization
  • Probability
  • Scheduling (Production)
  • Security
  • Steady State

Readers

  • Aerospace logistics and air mobility.
  • Aviation Science / Aeronautics.
  • Mathematical Modeling and Probability Theory.