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 VT that satisfies all demands for 1 ≤ T ≤ ∞, as well as the optimal schedule that minimizes lost sales for a given fleet size smaller than VT. 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 ≤ ∞. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
