کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6894870 | 1445933 | 2018 | 37 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The job shop scheduling problem with convex costs
ترجمه فارسی عنوان
مشکل زمانبندی کار فروشگاه با هزینه های محدب
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
The job shop scheduling literature has been dominated by a focus on regular objective functions - in particular the makespan - in its half a century long history. The last twenty years have encountered a spike of interest in other objectives, such as the total weighted tardiness, but research on non-regular objective functions has always been isolated and scattered. Motivated by this observation, we present a tabu search heuristic for a large class of job shop scheduling problems, where the objective is non-regular in general and minimizes a sum of separable convex cost functions attached to the operation start times and the differences between the start times of arbitrary pairs of operations. This problem definition generalizes a number of problems considered earlier in the literature. A particular notion of “critical paths” derived from the so-called timing problem is at the core of the proposed neighborhood definition exploited successfully in a tabu search algorithm. The computational results attest to the promise of our work.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 268, Issue 1, 1 July 2018, Pages 82-100
Journal: European Journal of Operational Research - Volume 268, Issue 1, 1 July 2018, Pages 82-100
نویسندگان
Reinhard Bürgy, Kerem Bülbül,