کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5082040 | 1477622 | 2009 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Makespan minimization for a 2-stage assembly scheduling problem subject to component available time constraint
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper considers a 2-stage assembly flowshop scheduling problem where each job is assembled with two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced subject to job-dependent lead time but the other type is fabricated in-house, at the first stage. The problem is shown to be NP-complete in the strong sense. Some solution properties are characterized, based on which three heuristic algorithms are derived. A branch-and-bound algorithm is also derived by use of the associated three lower bounds and several dominance properties. Numerical experiments are conducted to evaluate the performances of the proposed branch-and-bound and heuristic algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 119, Issue 2, June 2009, Pages 392-401
Journal: International Journal of Production Economics - Volume 119, Issue 2, June 2009, Pages 392-401
نویسندگان
Chang Sup Sung, Jaeho Juhn,