The efficient algorithm for optimal assignment based on the conditional invariant condition

2016 Fiscal Year Final Research Report

• Project/Area Number: 26350427
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Multi-year Fund
• Section: 一般
• Research Field: Social systems engineering/Safety system
• Research Institution: Tokyo Metropolitan University
• Principal Investigator: Yamamoto Hisashi 首都大学東京, システムデザイン研究科, 教授 (60231677)
• Research Collaborator: KONG Xianda ; TAKAHASHI Natsumi ; NAKAMURA Taishin
• Project Period (FY): 2014-04-01 – 2017-03-31
• Keywords: システム / 連続型 k－システム / 最適配置

Outline of Final Research Achievements

The consecutive-k-system is the system, which fail (operate) if and only if all components fails (operates) in a given range. These systems can be applied to a supervisor system of sensors located in a space, etc. This study considered the invariant property that the optimal system configuration can be obtained by the ranks of component reliabilities even if the component reliabilities are not given exactly. 1) For the special consecutive-k-systems, the conditions of system size and components reliability was clear for the invariant property. 2) Based on the condition, the algorithm was proposed for the optimal assignments. The result are useful when we design the optimal consecutive-k-systems. In addition, the result was applicable to the worker/ equipment assignment problem.

Free Research Field

信頼性工学