کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
478708 | 1446132 | 2010 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations](/preview/png/478708.png)
چکیده انگلیسی
In this work, we take advantage of the powerful quadratic programming theory to obtain optimal solutions of scheduling problems. We apply a methodology that starts, in contrast to more classical approaches, by formulating three unrelated parallel machine scheduling problems as 0–1 quadratic programs under linear constraints. By construction, these quadratic programs are non-convex. Therefore, before submitting them to a branch-and-bound procedure, we reformulate them in such a way that we can ensure convexity and a high-quality continuous lower bound. Experimental results show that this methodology is interesting by obtaining the best results in literature for two of the three studied scheduling problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 201, Issue 3, 16 March 2010, Pages 729–736
Journal: European Journal of Operational Research - Volume 201, Issue 3, 16 March 2010, Pages 729–736
نویسندگان
M.-C. Plateau, Y.A. Rios-Solis,