کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
481475 1446175 2008 14 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain
چکیده انگلیسی

In this paper, we study the problem of synchronized scheduling of assembly and air transportation to achieve accurate delivery with minimized cost in consumer electronics supply chain. This problem was motivated by a major PC manufacturer in consumer electronics industry. The overall problem is decomposed into two sub-problems, which consist of an air transportation allocation problem and an assembly scheduling problem. The air transportation allocation problem is formulated as an integer linear programming problem with the objective of minimizing transportation cost and delivery earliness tardiness penalties. The assembly scheduling problem seeks to determine a schedule ensuring that the orders are completed on time and catch the flights such that the waiting penalties between assembly and transportation is minimized. The problem is formulated as a parallel machine scheduling problem with earliness penalties. The computational complexities of the two sub-problems are investigated. The air transportation allocation problem with split delivery is shown to be solvable. The parallel machine assembly scheduling problem is shown to be NP-complete. Simulated annealing based heuristic algorithms are presented to solve the parallel machine problem.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 187, Issue 2, 1 June 2008, Pages 442–455
نویسندگان
, , ,