In view of the existing sequence planning problem, this paper presents a process scheduling model based on polychromatic sets theory. To attain the similarity and individuality of constraints of parts, the process route decision was divided into stages. A feature machining chain and process feature ranking model were built beginning with the factors that influence the processing stage and technology feature. The adoption of polychromatic sets theory simplifies the evaluation of process constraints; thus, knowledge can be expressed easily. This method not only ensures the versatility of the system, but also satisfies the customer-oriented process resource.
목차
Abstract 0. Introduction 1. Basic Concept of Polychromatic Sets Theory 1.1. Polychromatic Sets 1.2. Concept of Polychromatic Sets Contour Comprising Matrix 2. Process Scheduling Model based on Polychromatic Sets Theory 2.1 Features: Working Step Mapping Rules 2.2 Process Step Chain Generation of Features of the Parts 2.3 Step Sequencing Model of the Process Route 3. Process Resource Allocation based on Polychromatic Sets Theory 4. Sample Verification 5. Conclusion Acknowledgment References
보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Grid and Distributed Computing
간기
격월간
pISSN
2005-4262
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.9 No.9