کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
475786 699375 2013 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
چکیده انگلیسی
The present paper studies the single machine, no-idle-time scheduling problem with a weighted quadratic earliness and tardiness objective. We investigate the relationship between this problem and the assignment problem, and we derive two lower bounds and several heuristic procedures based on this relationship. Furthermore, the applicability of the time-indexed integer programming formulation is investigated. The results of a computational experiment on a set of randomly generated instances show (1) the high-quality results of the proposed heuristics, (2) the low optimality gap of one of the proposed lower bounds and (3) the applicability of the integer programming formulation to small and medium size cases of the problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 40, Issue 7, July 2013, Pages 1819-1828
نویسندگان
, ,