잉크 색상 변화가 존재하는 인쇄 공정의 스케줄링

• 영문명: Scheduling of Printing Process in which Ink Color Changes Exist
• 발행기관: 한국산업경영시스템학회
• 저자명: 문재경(Jae Kyeong Moon) 엄현섭(Hyun Seop Uhm) 태현철(Hyun Chul Tae)
• 간행물 정보: 『산업경영시스템학회지』제44권 제4호, 32~42쪽, 전체 11쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2021.12.31

영문 초록

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.

목차

Ⅰ. 서론

Ⅱ. 관련 연구

Ⅲ. 문제 소개 및 수리모형

Ⅳ. 해법

Ⅴ. 실험 및 결과 분석

Ⅵ. 결론

Acknowledgements

References

키워드

Printing Process Scheduling Mixed Integer Programming 2-OPT Algorithm