Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop

Ahmed El-Bouri*, Subramaniam Balakrishnan, Neil Popplewell

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

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

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


A new, cooperative job dispatching approach is presented to minimize the mean flowtime in dynamic flowshops. A dispatching decision taken at any machine is reached collectively through consultation with other machines, and conflicting priorities are resolved by employing a penalty-based procedure. Computer results indicate that the proposed cooperative dispatching gives improvements ranging between 1.5% and 11.4% over other dispatching rules, under different levels of shop congestion, and for flowshops possessing various combinations of intermediate FIFO (first-come first-served) and non-FIFO buffers.

اللغة الأصليةEnglish
الصفحات (من إلى)819-833
عدد الصفحات15
دوريةInternational Journal of Production Economics
مستوى الصوت113
رقم الإصدار2
المعرِّفات الرقمية للأشياء
حالة النشرPublished - يونيو 2008

ASJC Scopus subject areas

  • ???subjectarea.asjc.1400???
  • ???subjectarea.asjc.2000.2002???
  • ???subjectarea.asjc.1800.1803???
  • ???subjectarea.asjc.2200.2209???


أدرس بدقة موضوعات البحث “Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا