کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1135793 | 1489102 | 2006 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Forward recursive scheme with improved marginal analysis heuristic for machine expansion scheduling in a new job shop
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
This study attempts to develop a method of machine expansion scheduling which determines how many machines should be purchased and allocated to every workstation during each period within the prescheduled ramp-up planning horizon in a new job shop to meet expected performance targets and minimize investment in machinery. This study suggests using the forward recursive scheme associated with marginal analysis heuristic, which itself is characterized by inherent simplicity and broad applicability, to solve the intricate problems of machine expansion scheduling. Furthermore, this study improves the marginal analysis heuristic, meaning that the algorithm incorporates an additional refining procedure to increase the possibility of achieving a solution close to the real optimum. Finally, this study used production data from an actual semiconductor manufacturer as an example to illustrate the proposed analytic algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 50, Issues 1â2, May 2006, Pages 148-160
Journal: Computers & Industrial Engineering - Volume 50, Issues 1â2, May 2006, Pages 148-160
نویسندگان
Ming-Guan Huang, Pao-Long Chang, Ying-Chyi Chou,