S142012 大規模物流センターにおける集配計画の研究([S14201]生産システムの新展開(応用・実践) (1))

Abstract

To efficiently control the logistic center, several problems occur to solve them. One of them is an order-picking problem. This problem is to assign picking items to workers and to determine picking navigation route. However, some schedule often makes a queue at the specific shelves. This study proposes a new scheduling method whose solution avoid such a queue as possible as it can. For this purpose, the order-picking problem is transformed into the job-shop problem (JSP) and Local Clustering Method (LCO) is applied to the JSP. The new method is verified to be efficient by comparing its solution with the preference rule's one.