Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues

Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues

0.00 Avg rating0 Votes
Article ID: iaor200398
Country: United States
Volume: 48
Issue: 8
Start Page Number: 732
End Page Number: 746
Publication Date: Dec 2001
Journal: Naval Research Logistics
Authors: ,
Keywords: markov processes
Abstract:

T identical exponential lifetime components out of which G are initially functioning (and B are not) are to be allocated to N subsystems, which are connected either in parallel or in series. Subsystem i, i = l,...,N, functions when at least Ki of its components function and the whole system is maintained by a single repairman. Component repair times are identical independent exponentials and repaired components are as good as new. The problem of the determination of the assembly plan that will maximize the system reliability at any (arbitrary) time instant t is solved when the component failure rate is sufficiently small. For the parallel configuration, the optimal assembly plan allocates as many components as possible to the subsystem with the smallest Ki and allocates functioning components to subsystems in increasing order of the Ki's. For the series configuration, the optimal assembly plan allocates both the surplus and the functioning components equally to all subsystems whenever possible, and when not possible it favors subsystems in decreasing order of the Ki's. The solution is interpreted in the context of the optimal allocation of processors and an initial number of jobs in a problem of routing time consuming jobs to parallel multiprocessor queues.

Reviews

Required fields are marked *. Your email address will not be published.