Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop

Ahmed El-Bouri*, Subramaniam Balakrishnan, Neil Popplewell

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

16 Citations (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.

Original languageEnglish
Pages (from-to)819-833
Number of pages15
JournalInternational Journal of Production Economics
Issue number2
Publication statusPublished - Jun 2008


  • Dispatching rules
  • Dynamic scheduling
  • Flowshop
  • Mean flowtime
  • Scheduling

ASJC Scopus subject areas

  • General Business,Management and Accounting
  • Economics and Econometrics
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop'. Together they form a unique fingerprint.

Cite this