An empirical analysis of exact algorithms for solving non-preemptive flow shop scheduling problem

  • سال انتشار: 1401
  • محل انتشار: فصلنامه بین المللی تحقیقات در مهندسی صنایع، دوره: 11، شماره: 3
  • کد COI اختصاصی: JR_RIEJ-11-3_007
  • زبان مقاله: انگلیسی
  • تعداد مشاهده: 238
دانلود فایل این مقاله

نویسندگان

Md. Kawsar Ahmed Asif

Department of Mathematics, University of Dhaka, Dhaka-۱۰۰۰, Dhaka, Bangladesh.

Shahriar Alam

Department of Industrial and Production Engineering, Military Institute of Science and Technology, Dhaka-۱۲۱۶, Dhaka, Bangladesh.

Sohana Jahan

Department of Mathematics, University of Dhaka, Dhaka-۱۰۰۰, Dhaka, Bangladesh.

Md. Rajib Arefin

Department of Mathematics, University of Dhaka, Dhaka-۱۰۰۰, Dhaka, Bangladesh.

چکیده

Sequencing and scheduling are the forms of decision-making approach that play a vital role in the automation and services industries. Efficient scheduling can help the industries to achieve the full potential of their supply chains. Conversely, inefficient scheduling causes additional idle time for machines and reduces productivity, which may escalate the product price. This study aims to find the most effective algorithm for solving sequencing and scheduling problems in a non-preemptive flow shop environment where the objective functions are to reduce the total elapsed time and idle time. In this research, four prominent exact algorithms are considered and examined their efficiency by calculating the ‘total completion time’ and their goodness. In order to demonstrate the comparative analysis, numerical examples are illustrated. A Gantt chart is additionally conducted to exhibit the efficiency of these algorithms graphically. Eventually, a feasible outcome for each condition has been obtained by analyzing these four algorithms, which leads to getting a competent, time and cost-efficient algorithm.

کلیدواژه ها

Exact Algorithm, Flow shop, makespan, Optimal Sequence, scheduling

اطلاعات بیشتر در مورد COI

COI مخفف عبارت CIVILICA Object Identifier به معنی شناسه سیویلیکا برای اسناد است. COI کدی است که مطابق محل انتشار، به مقالات کنفرانسها و ژورنالهای داخل کشور به هنگام نمایه سازی بر روی پایگاه استنادی سیویلیکا اختصاص می یابد.

کد COI به مفهوم کد ملی اسناد نمایه شده در سیویلیکا است و کدی یکتا و ثابت است و به همین دلیل همواره قابلیت استناد و پیگیری دارد.