The printing process can have to print various colors with a limited capacity of printing facility such as ink containers that are needed cleaning to change color. In each container, cleaning time exists to assign corresponding inks, and it is considered as the setup cost required to reduce the increasing productivity. The existing manual method, which is based on the worker’s experience or intuition, is difficult to respond to the diversification of color requirements, mathematical modeling and algorithms are suggested for efficient scheduling. In this study, we propose a new type of scheduling problem for the printing process. First, we suggest a mathematical model that optimizes the color assignment and scheduling. Although the suggested model guarantees global optimality, it needs a lot of computational time to solve. Thus, we decompose the original problem into sequencing orders and allocating ink problems. An approximate function is used to compute the job scheduling, and local search heuristic based on 2-opt algorithm is suggested for reducing computational time. In order to verify the effectiveness of our method, we compared the algorithms' performance. The results show that the suggested decomposition structure can find acceptable solutions within a reasonable time. Also, we present schematized results for field application.

1. 서 론
2. 관련 연구
3. 문제 소개 및 수리모형
    3.1 문제 소개
    3.2 수리모형
4. 해법
    4.1 상위 부분 문제 해법
    4.2 하위 부분 문제 해법
5. 실험 및 결과 분석
    5.1 상위 부분 문제 파라미터 결정 실험
    5.2 해법 검증 실험
    5.3 실험 결과 적용
6. 결론
References

• Jae Kyeong Moon(한국생산기술연구원 디지털헬스케어연구부문) | 문재경
• Hyun Seop Uhm(한국생산기술연구원 디지털헬스케어연구부문) | 엄현섭
• Hyun Chul Tae(한국생산기술연구원 디지털헬스케어연구부문) | 태현철 Corresponding Author