A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines

Publish Year: 1393
نوع سند: مقاله ژورنالی
زبان: English
View: 650

This Paper With 6 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_IJIEPR-25-1_007

تاریخ نمایه سازی: 7 شهریور 1393

Abstract:

Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessment the quality of this heuristic, this paper develop a global lower bound on FFS makespan problems with unrelated parallel machines.

Authors

N. Nahavandi

Associate Professor of Industrial Engineering, Department of Industrial Engineering, Tarbiat Modares University, Tehran, Iran,

E. Asadi Gangraj

PhD student, Department of Industrial Engineering, Faculty of Engineering, Tarbiat Modares University, Tehran, Iran.