کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7541468 | 1489048 | 2018 | 35 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The distributed permutation flow shop to minimise the total flowtime
ترجمه فارسی عنوان
جریان تقسیم توزیع شده برای به حداقل رساندن جریان کامل
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
چکیده انگلیسی
In the last years, researchers are paying special attention to scheduling in distributed environments due to the increasing benefits of multi-factory manufacture. In this paper, we address the distributed permutation flowshop scheduling problem to minimise the total flowtime. Since, to the best of our knowledge, this problem has not been addressed previously, we first analyse it and discuss several properties, theorems, assignment rules, representation of the solutions and speed-up procedures. Given that the problem is NP-hard, we focus on approximate procedures, and propose eighteen constructive heuristics to obtain high-quality solutions in reasonable CPU times. In addition, we propose an iterative improvement algorithm to further refine the so-obtained solutions. The extensive computational experience carried out shows that the proposed method outperforms several metaheuristics adapted from related scheduling problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 118, April 2018, Pages 464-477
Journal: Computers & Industrial Engineering - Volume 118, April 2018, Pages 464-477
نویسندگان
Victor Fernandez-Viagas, Paz Perez-Gonzalez, Jose M. Framinan,