Note: CLEVER or smart: Strategies for the online target date assignment problem

Authors:
Elisabeth Gassner;Johannes Hatzl;Sven O. Krumke;Sleman Saliba
Affiliations:
Graz University of Technology, Institute of Optimization and Discrete Mathematics, Steyrergasse 30, Graz, Austria;Graz University of Technology, Institute of Optimization and Discrete Mathematics, Steyrergasse 30, Graz, Austria;University of Kaiserslautern, Department of Mathematics, P.O.Box 3049, Paul-Ehrlich-Str. 14, 67653 Kaiserslautern, Germany;University of Kaiserslautern, Department of Mathematics, P.O.Box 3049, Paul-Ehrlich-Str. 14, 67653 Kaiserslautern, Germany
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 5
Cited 0

Online computation and competitive analysis

Online computation and competitive analysis
Amortized efficiency of list update rules

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Competitive analysis for dynamic multiperiod uncapacitated routing problems

Networks
The online target date assignment problem

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem

Operations Research Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, we consider the Online Target Date Assignment Problem (OnlineTDAP) for general downstream problems, where the downstream cost are nonnegative, additive and satisfy the triangle inequality. We analyze algorithm smart, which was introduced by Angelelli et al. [3] and give its exact competitive ratio depending on the number of requests. Since the obtained competitive ratio is at most 22-1~1.8284 we answer the question posed in Angelelli et al. [4] if smart has a competitive ratio strictly less than 2. Moreover, we introduce a new algorithm called clever and show that this strategy has a competitive ratio of 3/2. We show that this is asymptotically optimal by proving that no online algorithm can perform better than 3/2-@e.