کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1033307 | 943296 | 2009 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
علوم انسانی و اجتماعی
مدیریت، کسب و کار و حسابداری
استراتژی و مدیریت استراتژیک
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines; therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. Heuristic approaches are proposed to minimize the total tardiness criterion. A constructive heuristic that explores specific characteristics of the problem is presented. Moreover, a GRASP-based heuristic is proposed and coupled with a path relinking strategy to search for better outcomes. Computational tests are presented and the comparisons made with an adaptation of the NEH algorithm and with a branch-and-bound algorithm indicate that the new approaches are promising.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Omega - Volume 37, Issue 2, April 2009, Pages 272–281
Journal: Omega - Volume 37, Issue 2, April 2009, Pages 272–281
نویسندگان
Débora P. Ronconi, Luís R.S. Henriques,