Order batching and picking optimization in terms of supply chain management (SCM)

Thumbnail Image
Date
2004-01-01
Authors
Won, Jaeyeon
Major Professor
Advisor
Sigurdur Olafsson
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Organizational Unit
Industrial and Manufacturing Systems Engineering
The Department of Industrial and Manufacturing Systems Engineering teaches the design, analysis, and improvement of the systems and processes in manufacturing, consulting, and service industries by application of the principles of engineering. The Department of General Engineering was formed in 1929. In 1956 its name changed to Department of Industrial Engineering. In 1989 its name changed to the Department of Industrial and Manufacturing Systems Engineering.
Journal Issue
Is Version Of
Versions
Series
Department
Industrial and Manufacturing Systems Engineering
Abstract

In distribution center (DC), at the time of forming a batch, by considering the order holding time and picking time in the system, an algorithm based on the first-come, first served based (FCFS) rule is presented. In the proposed algorithm, both order picking factor and order holding factor are used in order to reflect the throughput of the system and response of orders.;Furthermore, some simple batching policies for considering the order holding time in the system are presented. They may result in meeting its customers' requirements for larger numbers of smaller orders and rapid turnaround. They reflect the well-known supply chain management (SCM) concept by taking the customer's need into consideration. Their performance measure of order response time that consists of order picking time and order holding time is evaluated and compared.;Finally, this thesis also develops a new optimization-based joint order batching and picking framework for warehousing and distribution systems. The nested partitions (NP) method that integrates global sampling of the feasible region and local search heuristic is applied to this problem. To speed up the computation, the improved NP-algorithm is developed. Also, by taking the special structure of the problem in account, an improved NP method in terms of small computational time is developed.

Comments
Description
Keywords
Citation
Source
Copyright
Thu Jan 01 00:00:00 UTC 2004