World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
Special Issue on Reliability Analysis and Optimization in Business and IndustryNo Access

ADAPTIVE RESOURCE ALLOCATION TO MAXIMIZE RUN-OUT TIMES

    https://doi.org/10.1142/S0217595912400179Cited by:0 (Source: Crossref)

    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.