Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Online computation and competitive analysis
Online computation and competitive analysis
On the On-line Number of Snacks Problem
Journal of Global Optimization
On-line k-Truck Problem and Its Competitive Algorithms
Journal of Global Optimization
Dynamic TCP acknowledgement: penalizing long delays
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Graph Transformations for the Vehicle Routing and Job Shop Scheduling Problems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Randomized k-server algorithms for growth-rate bounded graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling on identical machines: How good is LPT in an on-line setting?
Operations Research Letters
On the on-line k-taxi problem with limited look ahead
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
| Hi-index | 0.00 |
In this paper, the on-line k-truck transportation problem (k-OLTTP) whose objects are to be transported between the vertices of a given graph on which there are k mobile trucks to be scheduled is proposed. It is motivated by the research concerning on-line k-truck problem and on-line transportation problem. The goal is to minimize the makespan which is consumed to complete some on-line request sequence. Some preliminary knowledge is introduced and the model of k-OLTTP is established firstly. Two versions of a special case of k-OLTTP, namely 1-OLTTP, have been studied and some results are obtained. For the first version, Open-1-OLTTP, a lower bound of competitive ratio 2 is presented and two optimal on-line algorithms, Reschedule Strategy (RS) and Lay Over Strategy (LOS) respectively, are analyzed. For the second version, Close-1-OLTTP, a lower bound of competitive ratio $${1 \over 2} + {1 \over 2} \cdot \sqrt{1 + {4\over\theta}}$$ , where 驴 is the ratio between the time consumed by the loaded truck and the empty truck to travel the same distance, is also developed and on-line algorithms RS and LOS are proved to have competitive ratio 2. Finally, some interesting remarks concerning OLTTP and its future research are discussed.