메뉴 건너뛰기
소속 기관 / 학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
고객센터 ENG
주제분류

논문 기본 정보

저자정보
(인천대학교) (인천대학교) (인천대학교) (인천대학교)
저널정보
한국SCM학회 한국 SCM 학회지 한국SCM학회지 제25권 제1호
오류 신고하기

피인용 0

검색

    초록·키워드

    In the wake of post-pandemic shifts toward e-commerce, customer orders have become increasingly fragmented and complex, especially in B2C environments. These orders often involve a wide variety of SKUs in small quantities, posing significant challenges for automated warehouse operations. Among various systems, Goods-to-Person (GTP) solutions offer efficiency in picking and packing. However, ensuring balanced task distribution across multiple GTP stations remains a critical issue to avoid bottlenecks and optimize throughput. This study explores four task allocation methodologies to address load balancing and processing time minimization in GTP systems. Using 30 days of real customer order data, we apply (1) a baseline Greedy Heuristic, (2) a combination of Hierarchical Clustering (by product category) with Greedy Heuristic, (3) Constraint Programming (CP-SAT) based on equal item quantity distribution, and (4) CP-SAT based on equal order line distribution. Each method is evaluated in terms of load balance (standard deviation among stations) and maximum station processing time. The experimental results reveal that CP-based methods significantly improve workload balancing without increasing total processing time. In contrast, the clustering-based method showed limited effectiveness due to the heterogeneous nature of B2C orders. These findings underscore the importance of constraint-based strategies for achieving operational efficiency in modern, high-variability fulfillment centers.

    최근 본 자료 전체보기

      UCI(KEPA) : I410-151-25-02-093133637