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

Ahmed El-Bouri, Subrahmanya Nairy

Research output: Contribution to journalArticle

Abstract

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

Original languageEnglish
Pages (from-to)1785-1800
Number of pages16
JournalInternational Journal of Production Research
Volume49
Issue number6
DOIs
Publication statusPublished - Mar 15 2011

Fingerprint

Scheduling
Experiments
Dispatching
Buffer
Finite buffer
Flow shop
Flow time
Dispatching rules
Congestion

Keywords

  • dispatching rules
  • dynamic scheduling
  • finite buffer capacity
  • flowshop
  • mean flowtime

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research
  • Strategy and Management

Cite this

An investigation of cooperative dispatching for minimising mean flowtime in a finite-buffer-capacity dynamic flowshop. / El-Bouri, Ahmed; Nairy, Subrahmanya.

In: International Journal of Production Research, Vol. 49, No. 6, 15.03.2011, p. 1785-1800.

Research output: Contribution to journalArticle

@article{050103f8c6704277b1218df145b2a300,
title = "An investigation of cooperative dispatching for minimising mean flowtime in a finite-buffer-capacity dynamic flowshop",
abstract = "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",
keywords = "dispatching rules, dynamic scheduling, finite buffer capacity, flowshop, mean flowtime",
author = "Ahmed El-Bouri and Subrahmanya Nairy",
year = "2011",
month = "3",
day = "15",
doi = "10.1080/00207540903443253",
language = "English",
volume = "49",
pages = "1785--1800",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "6",

}

TY - JOUR

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

AU - El-Bouri, Ahmed

AU - Nairy, Subrahmanya

PY - 2011/3/15

Y1 - 2011/3/15

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

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

KW - dispatching rules

KW - dynamic scheduling

KW - finite buffer capacity

KW - flowshop

KW - mean flowtime

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

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

U2 - 10.1080/00207540903443253

DO - 10.1080/00207540903443253

M3 - Article

AN - SCOPUS:78650603042

VL - 49

SP - 1785

EP - 1800

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 6

ER -