کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
7541401 1489049 2018 36 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Two-machine job shop problem under availability constraints on one machine: Makespan minimization
ترجمه فارسی عنوان
مشکل دو کارخانه ماشین کاری تحت محدودیت های دسترسی در یک ماشین: به حداقل رساندن مکسپان
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی صنعتی و تولید
چکیده انگلیسی
This paper considers a two-machine job shop scheduling problem with availability constraints on one machine in order to minimize makespan. We consider the problem when unavailability periods are known in advance and operations are non-preemptive. First, two mixed integer linear programming models MILP1, MILP2 are presented. Secondly, we introduce some properties concerning the optimality of Jackson's algorithm under availability constraints. Consequently, new lower bounds are provided and an upper bound is obtained using heuristics based on Jackson's rule. Then, a branch and bound algorithm (B&B) incorporating these bounds is proposed to solve the problem. The performances of the proposed approaches are evaluated by comparing their solutions through well known benchmarks. Computational results prove the efficiency of the proposed B&B.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Industrial Engineering - Volume 117, March 2018, Pages 138-151
نویسندگان
, , ,