This paper considers a single machine scheduling problem where the machine is shared by multiple sub-production systems. Each sub-production systems has heterogeneous local objectives (e.g., minimization of total completion time, maximum tardiness and makespan).
In a distributed manufacturing environment, no sub-production system has complete information (e.g., processing time, due date) of the entire system. This paper provides a distributed scheduling method to find close-to-optimal coordination on the shared machine using minimum local information sharing among sub-production systems. The proposed method is compared to pareto solution that can be found in a centralized environment.

Abstract
 1. 서론
 2. A Multi-criteria distributed scheduling methodology for a single machine
 3. Solving a Centralized Problem
 4. A Solution Methodology using CICA
 5. Experimental Study
 6. Conclusion
 7. Reference

• 이용규(한양대학교 산업공학과)
• 정인재(한양대학교 산업공학과)