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, 147-165

Abstract: We pursue the analysis of the Hub Operation Scheduling Problem (HOSP) over the finite and infinite horizons. The demand is assumed deterministic and stationary. We deduce the minimum fleet size V T that satisfies all demands for 1 (le) T (le) (infinity), as well as the optimal schedule that minimizes lost sales for a given fleet size smaller than V T . Reintroducing the costs of empties and of delayed sales or, equivalently, the cost of empties and the gains from shipments, we resolve the issues of optimal allocation and optimal schedule over a horizon T (le) (infinity). Finally, we generalise the above results---still under the assumption of deterministic, stationary demands---first to the case in which each city communicates with its two “adjacent” cities (this is the “Wheel” problem) and then to the general network problem in which each terminal may communicate with any other terminal.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.11.2.147 (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:147-165

Access Statistics for this article

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