کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8903370 | 1632565 | 2018 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A Variable Neighborhood Descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A Variable Neighborhood Descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times A Variable Neighborhood Descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times](/preview/png/8903370.png)
چکیده انگلیسی
This paper addresses the total weighted tardiness minimization problem on unrelated parallel machines with sequence dependent setup times and job ready times. The problem consists in scheduling a set of jobs reducing the penalty costs caused by the delays in the job due dates. This is a NP-Hard problem and has been extensively studied in recent literature. In order to solve this, an ILS-VND hybrid metaheuristic is proposed, where a local search heuristic Variable Neighborhood Descent (VND) is integrated with Iterated Local Search (ILS) metaheuristic with multiple restarts. The results is compared with two state-of-art metaheuristics proposed in the literature. The statistical analysis indicates that for the most scenarios the proposed method outperforms the references metaheuristics.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 66, April 2018, Pages 191-198
Journal: Electronic Notes in Discrete Mathematics - Volume 66, April 2018, Pages 191-198
نویسندگان
Rodney O.M. Diana, Sérgio R. de Souza, Moacir F.F. Filho,