کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10347656 | 699335 | 2005 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Sequencing the processing of incoming mail to match an outbound truck delivery schedule
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
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 multi-center multi-machine system.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 32, Issue 7, July 2005, Pages 1777-1791
Journal: Computers & Operations Research - Volume 32, Issue 7, July 2005, Pages 1777-1791
نویسندگان
Qian Wang, Rajan Batta, Robert J. Szczerba,