Study on the Online Container Shipment Problem with Limited Prevision Information
Feifeng Zheng · Systems Engineering-Theory Methodology Application · 2004
The paper puts forward the online container shipment problem with limited prevision information, in which an online algorithm gets to know several requests in future when each request arrives. The relevant mathematic model is set up and analyzed. The Greedy hift strategy is brought forward accoding to the trait of the model. With the analysis method of worst case performance, it is proved that the Greedy shift strategy has a competitive ratio of (b+w-2)w.