Paper Info
Title
Sequencing the processing of incoming mail to match an outbound truck delivery schedule
Abstract
This paper considers the problem of sequencing the processing of incoming mail in a processing and distribution center (P&DC) to match a given outbound truck delivery schedule. Mail arrives at a P&DC from local associate offices or remote P&DCs following an incoming schedule. The mail from an origin has different proportions to different destinations. For each destination, there are trucks scheduled with limited capacities. The objective of the problem is to determine the sequence in which the incoming mail should be processed so that the total unused truck capacity is minimized. Since, we are not concerned with detailed scheduling/routing decisions inside the P&DC, we treat the P&DC system as a single machine. Dispatching rules and heuristics are proposed for this single machine problem and tested via computational experiments. Simulation experiments are performed to test the efficiency of these methods for the original multicenter multi-machine system.
Year
DOI
Venue
2005
10.1016/j.cor.2003.11.029
Computers & OR
Keywords
DocType
Volume
different destination,Heuristics,DC system,different proportion,remote P,incoming mail,single machine,Simulation,outbound truck delivery schedule,single machine problem,incoming schedule,original multicenter multi-machine system,Mail processing
Journal
32
Issue
ISSN
Citations 
7
Computers and Operations Research
8
PageRank 
References 
Authors
0.62
1
3
Name
Order
Citations
PageRank
Qian Wang180.62
Rajan Batta284989.39
Robert J. Szczerba3172.44