작업완료시각 추정을 활용한 배치 스케줄링 및 사례 연구

• 영문명: Batch Scheduling Algorithm with Approximation of Job Completion Times and Case Studies
• 발행기관: 한국산업경영시스템학회
• 저자명: 김송은(Song-Eun Kim) 박성현(Seong-Hyeon Park) 김수민(Su-Min Kim) 박경수(Kyungsu Park) 황민형(Min Hyung Hwang) 성종은(Jongeun Seong)
• 간행물 정보: 『산업경영시스템학회지』제43권 제4호, 23~32쪽, 전체 10쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2020.12.30

영문 초록

Many small and medium-sized manufacturing companies process various product types to respond different customer orders in a single production line. To improve their productivity, they often apply batch processing while considering various product types, constraints on batch sizes and setups, and due date of each order. This study introduces a batch scheduling heuristic for a production line with multiple product types and different due dates of each order. As the process times vary due to the different batch sizes and product types, a recursive equation is developed based on a flow line model to obtain the upper bound on the completion times with less computational complexity than full computation. The batch scheduling algorithm combines and schedules the orders with same product types into a batch to improve productivity, but within the constraints to match the due dates of the orders. The algorithm incorporates simple and intuitive principles for the purpose of being applied to small and medium companies. To test the algorithm, two case studies are introduced; a high pressure coolant (HPC) manufacturing line and a press process at a plate-type heat exchanger manufacturer. From the case studies, the developed algorithm provides significant improvements in setup frequency and thus convenience of workers and productivity, without violating due dates of each order.

목차

1. 서 론

2. 기존 연구 및 문헌 조사

3. 플로우 라인 모델

4. 배치 사이즈 및 순서 결정 알고리즘

5. 사례연구

6. 결 론

References

키워드

Batch Scheduling Flow Line Models Upper Bound on Completion Time Batch Size