The “Hub” and “Wheel” Scheduling Problems

Sanji Arisawa and Salah E. Elmaghraby
Additional contact information
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

Transportation Science, 1977, vol. 11, issue 2, 124-146

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.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.11.2.124 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:11:y:1977:i:2:p:124-146

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().