کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1136961 1489176 2009 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An algorithm for solving the multi-period online fulfillment assignment problem
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
An algorithm for solving the multi-period online fulfillment assignment problem
چکیده انگلیسی

This paper develops an optimal solution procedure for the multi-period online fulfillment assignment problem to determine how many and which of a retailer/e-tailer’s capacitated regional warehouse locations should be set up to handle online sales over a finite planning horizon. To reduce the number of candidate solutions in each period, dominance rules from the facility location literature are extended to handle the nonlinear holding and backorder cost implications of our problem. Computational results indicate that multi-period considerations can play a major role in determining the optimal set of online fulfillment locations. In 92% of our test problems, the multi-period solution incorporated fewer openings and closings than myopic single period solutions. To illustrate the use of the model under changing demands, the multi-period solution yielded different supply chain configurations than the myopic single period solution in over 37% of the periods.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Mathematical and Computer Modelling - Volume 50, Issues 9–10, November 2009, Pages 1294–1304
نویسندگان
, , ,