The 'Hub' and 'Wheel' Scheduling Problems. Part II. HOSP: Multi-Period and Infinite Horizon. Part III. The Wheel Operation Scheduling Problem.
Abstract
Part II pursues the analysis of the Hub Operation Scheduling Problem (HOSP) over the finite and infinite horizons. The demand is assumed deterministic and stationary. The minimum fleet size deduction is made, that satisfies all demands, as well as the optimal schedule (that minimizes lost sales) for a given fleet size. Re-introducing the costs of empties and of delayed sales -- or equivalently, the cost of empties and the gains from shipments, the issues of optimal allocation and optimal schedule is resolved over a finite or infinite horizon. Part III generalizes the above results -- still under the assumptions of deterministic, stationary demands -- first to the case in which each city communicates with its two adjacent cities - the wheel problem -- and then to the general network problem in which each terminal may communicate with any other terminal.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1975
- Accession Number
- ADA022319
Entities
People
- Salah E. Elmaghraby
- Sanji Arisawa
Organizations
- North Carolina State University