Loading...

A comparison of two estimators for solutions to greedy algorithm in scheduling depletable sources

Kianfar, S ; Sharif University of Technology | 2008

375 Viewed
  1. Type of Document: Article
  2. Publisher: 2008
  3. Abstract:
  4. There are many depletable resource planning problems associated with convex cost function. The Greedy algorithm has been used to find the optimal solution for such problems. But exploiting that algorithm requires a large bulk of computations to find the optimal solution. Thus, in this paper we have established two piecewise linear estimators for the convex cost function: an inner intersection of the function values and an outer tangent. A practical experiment was conducted to compare the performance of the two presented estimators and it was observed that the outer tangent performs more efficiently than the inner intersection. The execution time of the Greedy Algorithm and the estimation algorithm in this paper have been compared, and the results reveal that our algorithm works 54 times faster than the Greedy Algorithm
  5. Keywords:
  6. Decision making ; Functions ; Intersections ; Management ; Optimal systems ; Piecewise linear techniques ; Probability density function ; Resource allocation ; Risk analysis ; Risk management ; Risk perception ; Solutions ; Convex cost function ; Depletable sources ; Estimation algorithms ; Execution times ; Function values ; Greedy algorithm ; Greedy algorithms ; Large bulks ; Linear estimation ; Optimal solutions ; Piecewise linear ; Resource planning ; Algorithms
  7. Source: International Conference on Risk Management and Engineering Management, Toronto, ON, 18 April 2008 through 18 April 2008 ; 2008 , Pages 80-85 ; 9780978348458 (ISBN)