This paper considers a job shop environment where machines are shared by several sub-production systems. The local objective of a sub-production system is the minimization of total completion time. In a centralized environment, a single decision maker has complete information of processing time, job routing and local objectives. In this case, the problem is a traditional job shop scheduling problem to minimize the total completion time which is well-known NP-hard problem. Meanwhile, it is assumed that no sub-production system has a complete view of the entire system in a distributed environment. This paper proposes a distributed scheduling methodology that maintains autonomy of each sub-production system while pursuing system-wide performance in job shop environment. The proposed method is compared to the performance of centralized solutions.

Abstract
 1. 개요
 2. 문제 상황
 3. CICA를 통한 연구 방법론
  3.1. 하위 생산시스템 최적화 문제
  3.2. 설비에이전트의 최적화 문제
 4. 실험 및 성능 평가
 5. 결론
 참고문헌

• 임승빈(한양대학교 산업공학과)
• 정인재(한양대학교 산업공학과)