科研之友
微信
新浪微博
Facebook
分享链接
摘要
We introduce a method for maximizing the run-out time for a system where the number of components available to make repairs is finite, and some of the components may be substituted for one another. The objective is to maximize the time at which the earliest run-out of any component occurs. The approach proposed here is to find the minimum time horizon such that no feasible allocation exists for a related linear programming problem. An adaptive version of this algorithm is proposed as a heuristic for the stochastic problem.
- 出版日期2012-6
