کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9664087 | 1446256 | 2005 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A linear time approximation algorithm for movement minimization in conveyor flow shop processing
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A linear time approximation algorithm for movement minimization in conveyor flow shop processing A linear time approximation algorithm for movement minimization in conveyor flow shop processing](/preview/png/9664087.png)
چکیده انگلیسی
We consider the movement minimization problem in a conveyor flow shop processing controlled by one worker for all machines. A machine can only execute tasks if the worker is present. Each machine can serve as a buffer. The worker has to cover a certain distance to move from one machine to the other. The distance between two machines Pp and Pq is |pâq|. The objective is to minimize the total distance the worker has to cover for the processing of all jobs. We introduce a linear time approximation algorithm for the conveyor flow shop problem with performance 3. Such minimization problems usually appear in conveyor controlled manufacturing systems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 160, Issue 2, 16 January 2005, Pages 485-500
Journal: European Journal of Operational Research - Volume 160, Issue 2, 16 January 2005, Pages 485-500
نویسندگان
W. Espelage, E. Wanke,