An investigation of cooperative dispatching for minimising mean flowtime in a finite-buffer-capacity dynamic flowshop

Ahmed El-Bouri*, Subrahmanya Nairy

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

نتاج البحث: المساهمة في مجلةمراجعة النظراء

2 اقتباسات (Scopus)

ملخص

Scheduling in a dynamic flowshop that receives jobs at random and unforeseen points in time has traditionally been done by using dispatching rules. This study compares the performances of leading dispatching rules with a cooperative dispatching approach, for the objective of minimising mean flowtime in a flowshop, in which the buffers that hold in-process jobs between machines have finite capacities. Cooperative dispatching employs a consultative and consensus-seeking methodology for deciding which job to dispatch next on a machine. Computational experiments using randomly generated test problems for three different utilisation (congestion) levels are carried out for 5- and 10-machine flowshops, under a wide range of buffer capacities. The results highlight the sensitivity of some of the popular dispatching rules to buffer size. In contrast, cooperative dispatching emerges as a robust method that performs consistently well across the range of buffer sizes and machine utilisations tested. The reductions in mean flowtime obtained by cooperative dispatching, in comparison to the other dispatching rules, are particularly large in flowshops that operate with very tight buffer capacities and elevated levels of congestion

اللغة الأصليةEnglish
الصفحات (من إلى)1785-1800
عدد الصفحات16
دوريةInternational Journal of Production Research
مستوى الصوت49
رقم الإصدار6
المعرِّفات الرقمية للأشياء
حالة النشرPublished - مارس 15 2011

ASJC Scopus subject areas

  • ???subjectarea.asjc.1400.1408???
  • ???subjectarea.asjc.1800.1803???
  • ???subjectarea.asjc.2200.2209???

بصمة

أدرس بدقة موضوعات البحث “An investigation of cooperative dispatching for minimising mean flowtime in a finite-buffer-capacity dynamic flowshop'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا