کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
482226 1446211 2006 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Scheduling with controllable release dates and processing times: Makespan minimization
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Scheduling with controllable release dates and processing times: Makespan minimization
چکیده انگلیسی

The paper deals with the single-machine scheduling problem in which job processing times as well as release dates are controllable parameters and they may vary within given intervals. While all release dates have the same boundary values, the processing time intervals are arbitrary. It is assumed that the cost of compressing processing times and release dates from their initial values is a linear function of the compression amount. The objective is to minimize the makespan together with the total compression cost. We construct a reduction to the assignment problem for the case of equal release date compression costs and develop an O(n2) algorithm for the case of equal release date compression costs and equal processing time compression costs. For the bicriteria version of the latter problem with agreeable processing times, we suggest an O(n2) algorithm that constructs the breakpoints of the efficient frontier.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 175, Issue 2, 1 December 2006, Pages 751–768
نویسندگان
, , ,