کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
709770 | 892088 | 2012 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Mathematical model and lower bounds for multi stage jobshop scheduling problem with special blocking constraint
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مکانیک محاسباتی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
This paper deals with multi stage jobshop scheduling problem. At each stage, either a fix or a variable number of identical parallel machines are available to execute jobs operations. As often in industrial environment, no space is available between machines, a specific blocking constraint is taken into account. A linear integer mathematical model is proposed and executed in XPress-MP optimization software to solve short size instances of this problem and to validate proposed model. In order to be able to evaluate future heuristics solutions quality, four lower bounds are proposed, computed and evaluated with benchmark for symmetric and asymmetric machines repartition cases.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: IFAC Proceedings Volumes - Volume 45, Issue 6, 23–25 May 2012, Pages 98-104
Journal: IFAC Proceedings Volumes - Volume 45, Issue 6, 23–25 May 2012, Pages 98-104