총납기 최소화를 위한 롯트-오더할당 우선순위 규칙

• 영문명: Lot-Order Assignment Priority Rules to Minimize Total Tardiness
• 발행기관: 한국산업경영시스템학회
• 저자명: 김재곤(Jae-Gon Kim) 임승길(Seung-Kil Lim) 유우식(Woo-Sik Yoo) 송상화(Sang Hwa Song)
• 간행물 정보: 『한국산업경영시스템학회 학술대회』2013년 춘계학술대회 논문집, 229~229쪽, 전체 0쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2013.05.11

영문 초록

Lot-order assignment is the process of assigning items in lots being processed in a production facility to orders to meet due-dates of the orders. In this study, we consider the lot-order assignment problem (LOAP) with the objective of minimizing total tardiness of the orders with distinct due dates. We address similarity relationships between the LOAP and the single machine total tardiness scheduling problem (SMTTSP) and suggest priority rules for the LOAP based on those for the SMTTSP. Performances of the priority rules are compared with each other and with that of the commercial optimization software package in computational experiments.

키워드

lot-order assignment priority rules single machine total tardiness scheduling problem