کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482140 | 1446206 | 2007 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
An automated production system is considered in which several robots are used for transporting parts between workstations following a given route in a carousel mode. The problem is to maximize the throughput rate. Extending previous works treating scheduling problems for a single robot, we consider a more realistic case in which workstations are served by multiple robots. A graph model of the production process is developed, making it possible to apply PERT–CPM solution techniques. The problem is proved to be solvable in polynomial time.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 177, Issue 1, 16 February 2007, Pages 147–162
Journal: European Journal of Operational Research - Volume 177, Issue 1, 16 February 2007, Pages 147–162
نویسندگان
David Alcaide, Chengbin Chu, Vladimir Kats, Eugene Levner, Gerard Sierksma,