Earticle

초록

영어

As the sales volume of online shops increases, the job burden in the back-offices of the online shops also increases. Order picking is the most labor-intensive operation among the jobs in a back-office and mid-size pure click online shops are experiencing the time delay and complexity in order picking nowadays while fulfilling their customers" orders. Those warehouses of the mid-size shops are based on manual systems, and as order pickings are repeated, the warehouses get a mess and lots of products in those warehouses are getting missing, which results in severe delay in order picking. To overcome this kind of problem in online clothing shops, we research a methodology to locate warehousing products. When products arrive at a warehouse, they are packed into a box and located on a rack in the warehouse. At this point, the operator should determine the box to be put in and the location on the rack for the box to be put on. This problem could be formulated as an Integer Programming model, but the branch-and-bound algorithm to solve the IP model requires enormous computation, and sometimes it is even impossible to get a solution in a proper time. So, we relaxed the problem, developed a set of heuristics as a methodology to get a semi-optimum in an acceptable time, and proved by an experiment that the solutions by our methodology are satisfactory and acceptable by field managers.

목차

Abstract
 1. 서론
 2. 문헌 연구
  2.1 창고 관리와 주문상품 반출
  2.2 의류 쇼핑몰의 창고 관리
 3. 상품 배치 방법론
  3.1 상자 배치 문제
  3.2 최적 모형화
  3.3 문제 완화에 의한 모형화
  3.4 신규 브랜드의 처리
  3.5 통합 입고 휴리스틱
  3.6 최적성 및 복잡성
 4. 실험 및 결과
 5. 결론
 참고문헌

키워드

저자

• 송용욱 [ Yong Uk Song | 연세대학교 원주캠퍼스 경영학부 교수 ]
• 안병혁 [ Byung-Hyuk Ahn | 경상대학교 경영정보학과 교수 ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  JITAM [Journal of Information Technology Applications and Management]

• 간기

  격월간

• pISSN

  1598-6284

• eISSN

  2508-1209

• 수록기간

  1999~2026

• 십진분류

  KDC 005 DDC 005