IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v11y1977i2p124-146.html
   My bibliography  Save this article

The “Hub” and “Wheel” Scheduling Problems

Author

Listed:
  • Sanji Arisawa

    (Mitsubishi Petrochemical Co., Ltd., Tokyo, Japan)

  • Salah E. Elmaghraby

    (The Catholic University of Leuven and the European Institute for Advanced Studies in Management, Brussels)

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 procedures of solution reduce to simple marginal analysis that has been previously solved by Minas and Mitten. In the general case, a network flow model is proposed that is easily solved.

Suggested Citation

  • Sanji Arisawa & Salah E. Elmaghraby, 1977. "The “Hub” and “Wheel” Scheduling Problems," Transportation Science, INFORMS, vol. 11(2), pages 124-146, May.
  • Handle: RePEc:inm:ortrsc:v:11:y:1977:i:2:p:124-146
    DOI: 10.1287/trsc.11.2.124
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.11.2.124
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.11.2.124?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:11:y:1977:i:2:p:124-146. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.