The 'Hub' and 'Wheel' Scheduling Problems. Part 1. The 'Hub' Scheduling Problem: The Myopic Case.

Abstract

The problem is that of scheduling truck movement (loaded and empty) between a central depot (the hub) and a number of outlying cities. Current demand is known deterministically, but future demand is uncertain. The myopic case treats two periods only: the current period and one future period. The objective is to minimize the expected total operating penalty, consisting of the costs of moving empties and the costs of delaying shipments. In two special cases the procedure of solution reduces to simple marginal analysis. In the general case, a network flow model is proposed that is easily solved. Part II generalized the planning horizon to multiple planning periods, including the infinite horizon. Part III generalizes the problem to permit inter-city shipments (the wheel problem).

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1975
Accession Number
ADA008425

Entities

People

  • Salah E. Elmaghraby
  • Sanji Arisawa

Organizations

  • North Carolina State University

Tags

DTIC Thesaurus Topics

  • Engineering
  • Gantt Charts
  • Management Engineering
  • Management Planning And Control
  • Pert
  • Scheduling (Production)

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Aerospace logistics and air mobility.
  • Statistical inference.