Throughput Maximization of Parcel Sorter Systems by Scheduling Inbound Containers

Abstract

This paper addresses the inbound container scheduling problem for automated sorter systems in express parcel sorting. The purpose is to analyze which container scheduling approaches maximize the throughput of sorter systems. We build on existing literature, particularly on the dynamic load balancing algorithm designed for the parcel hub scheduling problem, and adapt the existing algorithm to include travel times on sorters. Then, we conduct computational experiments to analyze the performance of different scheduling approaches for different operational scenarios and system layouts.