Abstract
We study the order picking problem in carousels system with a single picker. The objective is to find a picking scheduling to minimizing the total order picking time. After showing the problem being strongly in NP-Hard and finding two characteristics, we construct an approximation algorithm for a special case (two carousels) and a heuristics for the general problem. Experimental results verify that the solutions are quickly and steadily achieved and show its better performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.