THE 'HUB' AND 'WHEEL' SCHEDULING PROBLEMS. PART 1. THE 'HUB' SCHEDULING PROBLEM: THE MYOPIC CASE

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).

  • Supplemental Notes:
    • Sponsored in part by National Science Foundation, Washington, D.C.
  • Corporate Authors:

    North Carolina State University, Raleigh

    Operations Research
    Raleigh, NC  USA 

    Office of Naval Research

    Department of the Navy, 800 North Quincy Street
    Arlington, VA  USA  22217

    Army Research Office

    Research Triangle Pk, NC  USA  27711

    National Science Foundation

    1800 G Street, NW
    Washington, DC  USA  20550
  • Authors:
    • Arisawa, S
    • Elmaghraby, S E
  • Publication Date: 1975-3

Media Info

  • Pagination: 46 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00090893
  • Record Type: Publication
  • Source Agency: National Technical Information Service
  • Report/Paper Numbers: NCSU-OR-102 Res. Rpt.
  • Files: TRIS
  • Created Date: Jun 26 1975 12:00AM