Abstract
AbstractBottleneck transportation problems usually arise in connection with perishable comnjodities that have to be distributed as quickly as possible. A new approach is given that often permits the acceleration of the distribution. This reduction of the classical bottleneck time is obtained by allowing certain overshipments in the network. A primal algorithm will be given that determines completely the bottleneck time overshipment function. The technique will include capacity restrictions, and will also yield an efficient solution procedure for the classical bottleneck problem and for overshipment problems.
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 callMore From: INFOR: Information Systems and Operational Research
Disclaimer: 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.
