کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1704798 1012416 2012 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مکانیک محاسباتی
پیش نمایش صفحه اول مقاله
Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
چکیده انگلیسی

The optimization problem addressed in this paper is an advanced form of the flexible job shop scheduling problem (FJSP) which also covers process plan flexibility and separable/non-separable sequence dependent setup times in addition to routing flexibility. Upon transforming the problem into an equivalent network problem, two mixed integer goal programming models are formulated. In the first model (Model A) the sequence dependent setup times are non-separable. In the second one (Model B) they are separable. Model B is obtained from Model A with a minor modification. The formulation of the models is described on a small sized numerical example and the solutions are interpreted. Finally, computational results are obtained on test problems.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematical Modelling - Volume 36, Issue 2, February 2012, Pages 846–858
نویسندگان
, , ,