کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
482035 1446168 2008 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Lower bounds for the earliness–tardiness scheduling problem on parallel machines with distinct due dates
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Lower bounds for the earliness–tardiness scheduling problem on parallel machines with distinct due dates
چکیده انگلیسی

This paper addresses the parallel machine scheduling problem in which the jobs have distinct due dates with earliness and tardiness costs. New lower bounds are proposed for the problem, they can be classed into two families. First, two assignment-based lower bounds for the one-machine problem are generalized for the parallel machine case. Second, a time-indexed formulation of the problem is investigated in order to derive efficient lower bounds throught column generation or Lagrangean relaxation. A simple local search algorithm is also presented in order to derive an upper bound. Computational experiments compare these bounds for both the one machine and parallel machine problems and show that the gap between upper and lower bounds is about 1.5%.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 189, Issue 3, 16 September 2008, Pages 1305–1316
نویسندگان
, , ,