Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop

Ahmed El-Bouri, Subramaniam Balakrishnan, Neil Popplewell

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

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
Volume113
Issue number2
DOIs
Publication statusPublished - Jun 2008

Fingerprint

Dispatching
Flow shop
Flow time
Penalty
Dispatching rules
Buffer
Congestion

Keywords

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

ASJC Scopus subject areas

  • Economics and Econometrics
  • Industrial and Manufacturing Engineering

Cite this

Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop. / El-Bouri, Ahmed; Balakrishnan, Subramaniam; Popplewell, Neil.

In: International Journal of Production Economics, Vol. 113, No. 2, 06.2008, p. 819-833.

Research output: Contribution to journalArticle

El-Bouri, Ahmed ; Balakrishnan, Subramaniam ; Popplewell, Neil. / Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop. In: International Journal of Production Economics. 2008 ; Vol. 113, No. 2. pp. 819-833.
@article{b6ebfc1d5f9e41a3a0978eb637013a20,
title = "Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop",
abstract = "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.",
keywords = "Dispatching rules, Dynamic scheduling, Flowshop, Mean flowtime, Scheduling",
author = "Ahmed El-Bouri and Subramaniam Balakrishnan and Neil Popplewell",
year = "2008",
month = "6",
doi = "10.1016/j.ijpe.2007.11.005",
language = "English",
volume = "113",
pages = "819--833",
journal = "International Journal of Production Economics",
issn = "0925-5273",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop

AU - El-Bouri, Ahmed

AU - Balakrishnan, Subramaniam

AU - Popplewell, Neil

PY - 2008/6

Y1 - 2008/6

N2 - 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.

AB - 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.

KW - Dispatching rules

KW - Dynamic scheduling

KW - Flowshop

KW - Mean flowtime

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=43549094013&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=43549094013&partnerID=8YFLogxK

U2 - 10.1016/j.ijpe.2007.11.005

DO - 10.1016/j.ijpe.2007.11.005

M3 - Article

AN - SCOPUS:43549094013

VL - 113

SP - 819

EP - 833

JO - International Journal of Production Economics

JF - International Journal of Production Economics

SN - 0925-5273

IS - 2

ER -