کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10370327 | 876043 | 2005 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A fast tabu search algorithm for the group shop scheduling problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزار
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling problems, have been widely studied in the literature. However, very few articles address the group shop scheduling problem introduced in 1997, which is a general formulation that covers the three above mentioned shop scheduling problems and the mixed shop scheduling problem. In this paper, we apply tabu search to the group shop scheduling problem and evaluate the performance of the algorithm on a set of benchmark problems. The computational results show that our tabu search algorithm is typically more efficient and faster than the other methods proposed in the literature. Furthermore, the proposed tabu search method has found some new best solutions of the benchmark instances.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Advances in Engineering Software - Volume 36, Issue 8, August 2005, Pages 533-539
Journal: Advances in Engineering Software - Volume 36, Issue 8, August 2005, Pages 533-539
نویسندگان
S.Q. Liu, H.L. Ong, K.M. Ng,