کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
383859 | 660834 | 2010 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem](/preview/png/383859.png)
چکیده انگلیسی
We consider a two-agent scheduling problem on a two-machine flowshop setting, where the objective is to minimize the total tardiness of the first agent with the restriction that the number of tardy jobs of the second agent is zero. It is reported in the literature that the complexity of even two-machine flowshop problem, where both agents wish to complete their jobs as soon as possible, is shown NP-hard. Motivated by the limitation and suggestions, this paper proposes a branch-and-bound algorithm and a simulated annealing heuristic algorithm to search for the optimal solution and near-optimal solutions, respectively. Computational results are also presented to evaluate the performance of the proposed algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 37, Issue 9, September 2010, Pages 6594–6601
Journal: Expert Systems with Applications - Volume 37, Issue 9, September 2010, Pages 6594–6601
نویسندگان
Wen-Chiung Lee, Shiuan-kang Chen, Chin-Chia Wu,