Takeshi Koide

EFFICIENT COMPUTATION OF NETWORK RELIABILITY IMPORTANCE ON K-TERMINAL RELIABILITY

This paper proposes an algorithm to compute marginal reliability importance for network systems with k-terminal reliability efficiently. Marginal reliability importance is an appropriate quantitative measure on a system component against system reliability and it contributes to design of reliable systems. Computing marginal reliability importance in network systems is time-consuming due to its NP-hardness. This paper extends the algorithm proposed in our last study to deal with k-terminal reliability and incorporates an extended factoring theorem to improve the algorithm. Numerical experiments compare the proposed algorithm with a traditional method to reveal efficiency of the algorithm. The algorithm helps to construct efficient algorithm to reliable network design problems.

Comparison between two scale‐inspection and warranty policies for weight‐quality

Purpose – To make a theoretical comparison between two scale‐inspection and warranty policies for weight‐quality, one practical and the other theoretically grounded.Design/methodology/approach – Comparison is made in a Stackelberg game framework considering the consumers as well as the manufacturers viewpoint.Findings – The practical policy is more profitable for the manufacturer than the theoretical policy in many cases.Research limitations/implications – The study confines itself to scale‐inspection and warranty policies, but the underlying approach used in this paper can also be applied to other topics.Practical implications – The proposed model can also provide a lower bound for the warranty.Originality/value – The study compares a practical policy with a theoretical one from both the consumers and manufacturers point of view.