کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5082207 | 1477637 | 2008 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times](/preview/png/5082207.png)
چکیده انگلیسی
In this article, we consider flowshop scheduling problems with minimal and maximal time lag constraints. Such constraints extend precedence constraints between operations in the jobs and may be used to model various industrial applications. The objective is to minimize a non-classical criterion based on the weighted sum of machine completion times. We show that it generalizes makespan and we derive several complexity results for two- and three-machine problems. An exact algorithm based on a branch-and-bound procedure is developed to solve the permutation flowshop problem with m machines.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 112, Issue 1, March 2008, Pages 168-176
Journal: International Journal of Production Economics - Volume 112, Issue 1, March 2008, Pages 168-176
نویسندگان
J. Fondrevelle, A. Oulamara, M.-C. Portmann,