کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6892788 | 699174 | 2016 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An order scheduling problem with position-based learning effect
ترجمه فارسی عنوان
یک مشکل زمان بندی سفارش با اثر یادگیری مبتنی بر موقعیت
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
سفارش برنامه ریزی، شبیه سازی شده، روش بهینه سازی ذرات ذرات، عقب ماندگی، اثر یادگیری،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
The order scheduling problem is receiving increasing attention in the relatively new but creative area of scheduling research. In order scheduling, several orders are processed on multiple machines, and each order comprises multiple components. The order completion time is defined as the time at which all components in an order are completed. In previous studies, the processing times of all components were fixed in order scheduling problems. This is unreasonable because a steady decline in processing time usually occurs when the same task is performed repeatedly in practical situations. Therefore, we propose a multiple-machine order scheduling problem with a learning effect to minimize the total tardiness. We develop a branch-and-bound algorithm incorporating certain dominance rules and three lower bounds for obtaining the optimal solution. Subsequently, we propose simulated annealing, particle swarm optimization, and order-scheduling MDD algorithms for obtaining a near-optimal solution. In addition, the experimental results of all proposed algorithms are provided.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 74, October 2016, Pages 175-186
Journal: Computers & Operations Research - Volume 74, October 2016, Pages 175-186
نویسندگان
Jianyou Xu, Chin-Chia Wu, Yunqiang Yin, Chuanli Zhao, Yi-Tang Chiou, Win-Chin Lin,