کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9664033 | 1446254 | 2005 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A travelling salesman approach to solve the F/no-idle/Cmax problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A travelling salesman approach to solve the F/no-idle/Cmax problem A travelling salesman approach to solve the F/no-idle/Cmax problem](/preview/png/9664033.png)
چکیده انگلیسی
This paper investigates the F/no-idle/Cmax problem, where machines work continuously without idle time intervals. The idle characteristic is a very strong constraint and it affects seriously the value of Cmax criterion. We treat here only the permutation flow-shop configuration for machine no-idle problems with the objective to minimise the makespan. Based on the idea that this problem can be modelled as a travelling salesman problem, an adaptation of the well-known nearest insertion rule is proposed to solve it. A computational study shows the result quality.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 161, Issue 1, 16 February 2005, Pages 11-20
Journal: European Journal of Operational Research - Volume 161, Issue 1, 16 February 2005, Pages 11-20
نویسندگان
Nour El Houda Saadani, Alain Guinet, Mohamed Moalla,