کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9663983 | 1446251 | 2005 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem](/preview/png/9663983.png)
چکیده انگلیسی
We extend the dynasearch technique, recently proposed by Congram et al., in the context of time-dependent combinatorial optimization problems. As an application we consider a general time-dependent (idleness) version of the well known single-machine total weighted tardiness scheduling problem, in which the processing time of a job depends on its starting time of execution. We develop a multi-start local search algorithm and present experimental results on several types of instances showing the superiority of the dynasearch neighborhood over the traditional one.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 162, Issue 1, 1 April 2005, Pages 281-289
Journal: European Journal of Operational Research - Volume 162, Issue 1, 1 April 2005, Pages 281-289
نویسندگان
E. Angel, E. Bampis,