A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

Cooperative Dispatching is a real-time scheduling methodology, which consults downstream machines before making a job dispatching decision on any given machine. This paper proposes such an approach for minimizing the mean tardiness in a dynamic flowshop where new jobs arrive continuously, at random points in time, throughout the production cycle. Cooperative Dispatching is based on the idea that individual machines act self-interestedly, with the objective of optimizing their local performance criteria. A consulted machine attempts to influence upstream dispatching decisions in a manner that promotes its ability to minimize its total local tardiness. A machines influence in the dispatching decision depends on current congestion and due-date tightness levels in the shop. A multiple regression model is proposed to help determine the weight a consulted machines preferences will carry in the dispatching decision. Conflicting demands from the different machines are resolved by a minimum regret decision procedure, which aims to minimize the aggregate deviation from the consulted machines preferences. The winning candidate that ultimately emerges from this procedure is the job that is dispatched. A comparative analysis to evaluate the performance of cooperative dispatching, compared to six other dispatching rules that are commonly favoured for tardiness-based criteria, is performed by means of simulation, using randomly generated test problems. Computational results indicate that Cooperative Dispatching outperforms the other dispatching rules, across a broad range of flowshop congestion and due-date tightness levels.

Original languageEnglish
Pages (from-to)1305-1314
Number of pages10
JournalComputers and Operations Research
Volume39
Issue number7
DOIs
Publication statusPublished - Jul 2012

Fingerprint

Dispatching
Tardiness
Flow Shop
Scheduling
Dispatching Rules
Due Dates
Tightness
Congestion
Minimise
Regret
Flow shop
Multiple Regression
Decision Procedures
Multiple Models
Comparative Analysis
Test Problems
Computational Results
Regression Model
Deviation
Real-time

Keywords

  • Dispatching rules
  • Flowshop
  • Heuristics
  • Mean tardiness
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Cite this

A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop. / El-Bouri, Ahmed.

In: Computers and Operations Research, Vol. 39, No. 7, 07.2012, p. 1305-1314.

Research output: Contribution to journalArticle

@article{2babedbd381d4e098d1d7380f2627402,
title = "A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop",
abstract = "Cooperative Dispatching is a real-time scheduling methodology, which consults downstream machines before making a job dispatching decision on any given machine. This paper proposes such an approach for minimizing the mean tardiness in a dynamic flowshop where new jobs arrive continuously, at random points in time, throughout the production cycle. Cooperative Dispatching is based on the idea that individual machines act self-interestedly, with the objective of optimizing their local performance criteria. A consulted machine attempts to influence upstream dispatching decisions in a manner that promotes its ability to minimize its total local tardiness. A machines influence in the dispatching decision depends on current congestion and due-date tightness levels in the shop. A multiple regression model is proposed to help determine the weight a consulted machines preferences will carry in the dispatching decision. Conflicting demands from the different machines are resolved by a minimum regret decision procedure, which aims to minimize the aggregate deviation from the consulted machines preferences. The winning candidate that ultimately emerges from this procedure is the job that is dispatched. A comparative analysis to evaluate the performance of cooperative dispatching, compared to six other dispatching rules that are commonly favoured for tardiness-based criteria, is performed by means of simulation, using randomly generated test problems. Computational results indicate that Cooperative Dispatching outperforms the other dispatching rules, across a broad range of flowshop congestion and due-date tightness levels.",
keywords = "Dispatching rules, Flowshop, Heuristics, Mean tardiness, Scheduling",
author = "Ahmed El-Bouri",
year = "2012",
month = "7",
doi = "10.1016/j.cor.2011.07.004",
language = "English",
volume = "39",
pages = "1305--1314",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "7",

}

TY - JOUR

T1 - A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop

AU - El-Bouri, Ahmed

PY - 2012/7

Y1 - 2012/7

N2 - Cooperative Dispatching is a real-time scheduling methodology, which consults downstream machines before making a job dispatching decision on any given machine. This paper proposes such an approach for minimizing the mean tardiness in a dynamic flowshop where new jobs arrive continuously, at random points in time, throughout the production cycle. Cooperative Dispatching is based on the idea that individual machines act self-interestedly, with the objective of optimizing their local performance criteria. A consulted machine attempts to influence upstream dispatching decisions in a manner that promotes its ability to minimize its total local tardiness. A machines influence in the dispatching decision depends on current congestion and due-date tightness levels in the shop. A multiple regression model is proposed to help determine the weight a consulted machines preferences will carry in the dispatching decision. Conflicting demands from the different machines are resolved by a minimum regret decision procedure, which aims to minimize the aggregate deviation from the consulted machines preferences. The winning candidate that ultimately emerges from this procedure is the job that is dispatched. A comparative analysis to evaluate the performance of cooperative dispatching, compared to six other dispatching rules that are commonly favoured for tardiness-based criteria, is performed by means of simulation, using randomly generated test problems. Computational results indicate that Cooperative Dispatching outperforms the other dispatching rules, across a broad range of flowshop congestion and due-date tightness levels.

AB - Cooperative Dispatching is a real-time scheduling methodology, which consults downstream machines before making a job dispatching decision on any given machine. This paper proposes such an approach for minimizing the mean tardiness in a dynamic flowshop where new jobs arrive continuously, at random points in time, throughout the production cycle. Cooperative Dispatching is based on the idea that individual machines act self-interestedly, with the objective of optimizing their local performance criteria. A consulted machine attempts to influence upstream dispatching decisions in a manner that promotes its ability to minimize its total local tardiness. A machines influence in the dispatching decision depends on current congestion and due-date tightness levels in the shop. A multiple regression model is proposed to help determine the weight a consulted machines preferences will carry in the dispatching decision. Conflicting demands from the different machines are resolved by a minimum regret decision procedure, which aims to minimize the aggregate deviation from the consulted machines preferences. The winning candidate that ultimately emerges from this procedure is the job that is dispatched. A comparative analysis to evaluate the performance of cooperative dispatching, compared to six other dispatching rules that are commonly favoured for tardiness-based criteria, is performed by means of simulation, using randomly generated test problems. Computational results indicate that Cooperative Dispatching outperforms the other dispatching rules, across a broad range of flowshop congestion and due-date tightness levels.

KW - Dispatching rules

KW - Flowshop

KW - Heuristics

KW - Mean tardiness

KW - Scheduling

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

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

U2 - 10.1016/j.cor.2011.07.004

DO - 10.1016/j.cor.2011.07.004

M3 - Article

VL - 39

SP - 1305

EP - 1314

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 7

ER -