کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5082983 | 1477659 | 2006 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Flow shop scheduling problem with limited machine availability: A heuristic approach
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper addresses the flow shop scheduling problem with limited machine availability. In such a problem, n jobs has to be scheduled on m machines under the makespan criterion and under the assumption that the machines are not available during the whole planning horizon. Since the makespan minimization is strongly NP-hard, we propose a heuristic approach to approximately solve the problem that consists in scheduling the jobs two by two according to an input sequence, and using a polynomial algorithm. This algorithm is an extension of the geometric approach developed for the two-job shop scheduling problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 99, Issues 1â2, JanuaryâFebruary 2006, Pages 4-15
Journal: International Journal of Production Economics - Volume 99, Issues 1â2, JanuaryâFebruary 2006, Pages 4-15
نویسندگان
Riad Aggoune, Marie-Claude Portmann,