On capital investment

被引:52
作者
Azar, Y [1 ]
Bartal, Y
Feuerstein, E
Fiat, A
Leonardi, S
Rosén, A
机构
[1] Tel Aviv Univ, Dept Comp Sci, Ramat Aviv, Israel
[2] Int Comp Sci Inst, Berkeley, CA 94704 USA
[3] Univ Buenos Aires, Fac Ciencias Exactas & Nat, Dept Computac, Buenos Aires, DF, Argentina
[4] Univ Gen Sarmiento, Inst Ciencias, Gen Sarmiento, Argentina
[5] Univ Rome La Sapienza, Dipartimento Informat Sistemist, Rome, Italy
[6] Univ Toronto, Dept Comp Sci, Toronto, ON, Canada
关键词
on-line algorithms; competitive ratio; on-line financial problems;
D O I
10.1007/PL00009281
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We deal with the problem of making capital investments in machines for manufacturing a product. Opportunities for investment occur over time, every such option consists of a capital cost for a new machine and a resulting productivity gain, i.e., a lower production cost for one unit of product. The goal is that of minimizing the total production costs and capital costs when future demand for the product being produced and investment opportunities are unknown. This can be viewed as a generalization of the ski-rental problem and related to the mortgage problem [3]. If all possible capital investments obey the rule that lower production costs require higher capital investments, then we present an algorithm with constant competitive ratio. If new opportunities may be strictly superior to previous ones (in terms of both capital cost and production cost), then we give an algorithm which is O(min {l + log C, 1 + log log P, 1 + log M}) competitive, where C is the ratio between the highest and the lowest capital costs, P is the ratio between the highest and the lowest production costs, and M is the number of investment opportunities. We also present a lower bound on the competitive ratio of any on-line algorithm for this case, which is Omega (min{log C, log log P/ log log log P, log M/ log log M}). This shows that the competitive ratio of our algorithm is tight (up to constant factors) as a function of C, and not far from the best achievable as a function of P and M.
引用
收藏
页码:22 / 36
页数:15
相关论文
共 6 条
[1]  
CHOU A, 1995, PROCEEDINGS OF THE SIXTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P467
[2]  
El-Yaniv R., 1993, Proceedings of the 2nd Israel Symposium on Theory and Computing Systems (Cat. No.93TH0520-7), P304, DOI 10.1109/ISTCS.1993.253458
[3]  
ELYTANIV R, 1992, P 33 IEEE ANN S FDN, P327
[4]  
Karp R, P IFIP 12 WORLD COMP, V992, P416
[5]  
RAGHAVAN P, 1991, DIMACS SERIES DISCRE, V7, P79
[6]   AMORTIZED EFFICIENCY OF LIST UPDATE AND PAGING RULES [J].
SLEATOR, DD ;
TARJAN, RE .
COMMUNICATIONS OF THE ACM, 1985, 28 (02) :202-208