Search-enhanced job dispatching in a dynamic permutation flowshop

Ahmed W. El-Bouri*

*المؤلف المقابل لهذا العمل

نتاج البحث

ملخص

A dynamic flowshop that continuously receives jobs at random points in time is considered, with the objective of scheduling the jobs in an order that minimizes the mean flowtime. A tabu search is proposed for deciding which job to dispatch next to the flowshop, and the approach is then compared by means of a computational analysis with a number of other competing dispatching rules. The results demonstrate that the search-enhanced dispatching method achieves reductions of between 13% and 17% in the mean flowtimes in comparison to the other dispatching rules. However, the proposed method is not as competitive in comparison to a more complex cooperative dispatching approach when shop congestion levels are medium to low.

اللغة الأصليةEnglish
عنوان منشور المضيفIEEM 2015 - 2015 IEEE International Conference on Industrial Engineering and Engineering Management
ناشرIEEE Computer Society
الصفحات199-203
عدد الصفحات5
مستوى الصوت2016-January
رقم المعيار الدولي للكتب (الإلكتروني)9781467380669
المعرِّفات الرقمية للأشياء
حالة النشرPublished - يناير 18 2016
الحدثIEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2015 - Singapore
المدة: ديسمبر ٦ ٢٠١٥ديسمبر ٩ ٢٠١٥

Other

OtherIEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2015
الدولة/الإقليمSingapore
المدينةSingapore
المدة١٢/٦/١٥١٢/٩/١٥

ASJC Scopus subject areas

  • ???subjectarea.asjc.1400.1401???
  • ???subjectarea.asjc.2200.2209???
  • ???subjectarea.asjc.2200.2213???

بصمة

أدرس بدقة موضوعات البحث “Search-enhanced job dispatching in a dynamic permutation flowshop'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا