The search algorithm for optimal or near optimal solutions of preventive maintenance (PM) schedules performs the search within a confined design space. This space is an enclosure which consists of two layers; the outer and the inner layer. The outer layer is defined by set of system properties while the inner by combination of set of system properties and constraints imposed on the constituent components of the system. The total number of potential PM schedules exists within the outer layer while that of feasible PM schedules is within the inner layer. As the number of constraints increases, determining this number (in outer and inner layer) becomes more complex especially within the inner layer. A pre-knowledge of this number before optimising the system for PM schedules informs the system engineer about the size of the feasible region. This size could be used in predicting the amount of work in performing a search and also in other performance measures for a given PM optimisation problem. The calculation of the size within the feasible region is the focus in this paper.
목차
Abstract 1. Introduction 2. System Design Space 2.1. Coefficient of Maintenance Interval (CoMI) 3. Preventive Maintenance Design Space 3.1. Feasible Region Modelling under Primary Constraints 3.2. Feasible Region Modelling under Component Substitution 4. Conclusions References
Shawulu Hunira Nggada [ Department of Software Engineering, School of Information Technology, Polytechnic of Namibia, 13Storch Street, Windhoek, Namibia ]
보안공학연구지원센터(IJCA) [Science & Engineering Research Support Center, Republic of Korea(IJCA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Control and Automation
간기
월간
pISSN
2005-4297
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Control and Automation Vol.7 No.4