Abstract

The scheduling of order-picking problems is a critical aspect of warehouse and distribution centre operations. The efficient execution of order picking requires determining the sequence in which it is needed to pick items from storage locations, as well as the assignment of employees to different picking tasks. In this paper, we present an approach to optimise the process using the Flexible Flow Shop Scheduling Problem (FFSSP), which encompasses multiple order fulfilment stages performing a set of operations on various machines (groups of employees) assigned to the picking stages (e.g., order creating, product collection, quality control, packing, shipment). The aim of the study was to determine the sequence of operations on the machines to minimise the order completion time while taking into account the available resources. We used IBM'sCP Optimizer. The computational experiments showed, on the one hand, the advantages of solver usage for relatively small instances providing optimal solutions, while on the other hand, it demonstrated its disadvantages as for 11 large instances from 24, optimal solutions were not found. Moreover, in 6 cases from 24 ones, the solution which was found was 94% worse than the optimal one.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.