Scheduling a dynamic flowshop to minimize the mean absolute deviation from distinct due dates

Ahmed W. El-Bouri

doi:10.1109/IEEM.2014.7058692

Scheduling a dynamic flowshop to minimize the mean absolute deviation from distinct due dates

Ahmed W. El-Bouri^*

^*Corresponding author for this work

Operations Management & Business Statistics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

A dynamic fowshop, where new job orders continuously arrive over the scheduling horizon, is considered in this study. The objective is to minimize the mean deviation from the due dates for the completed jobs. A cooperative dispatching approach is investigated for this objective, and its performance evaluated by comparison with other dispatching rules. The results from the comparative study indicate that the cooperative dispatching performs generally better than other dispatching rules for problems that are characterized by moderate to low due date tightness levels. In those instances where the jobs have moderately tight due dates, the cooperative dispatching approach produces mean absolute deviations that range between about 7 to 10% lower than the next best performing dispatching rule, across varying shop floor congestion levels.

Original language	English
Title of host publication	IEEM 2014 - 2014 IEEE International Conference on Industrial Engineering and Engineering Management
Publisher	IEEE Computer Society
Pages	521-525
Number of pages	5
Volume	2015-January
ISBN (Electronic)	9781479964109
DOIs	https://doi.org/10.1109/IEEM.2014.7058692
Publication status	Published - 2014
Event	2014 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2014 - Selangor, Malaysia Duration: Dec 9 2014 → Dec 12 2014

Other

Other	2014 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2014
Country/Territory	Malaysia
City	Selangor
Period	12/9/14 → 12/12/14

Keywords

Dispatching rules
due dates
flowshop

ASJC Scopus subject areas

Business, Management and Accounting (miscellaneous)
Industrial and Manufacturing Engineering
Safety, Risk, Reliability and Quality

Access to Document

10.1109/IEEM.2014.7058692

Cite this

Scheduling a dynamic flowshop to minimize the mean absolute deviation from distinct due dates. / El-Bouri, Ahmed W.
IEEM 2014 - 2014 IEEE International Conference on Industrial Engineering and Engineering Management. Vol. 2015-January IEEE Computer Society, 2014. p. 521-525 7058692.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

El-Bouri, AW 2014, Scheduling a dynamic flowshop to minimize the mean absolute deviation from distinct due dates. in IEEM 2014 - 2014 IEEE International Conference on Industrial Engineering and Engineering Management. vol. 2015-January, 7058692, IEEE Computer Society, pp. 521-525, 2014 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2014, Selangor, Malaysia, 12/9/14. https://doi.org/10.1109/IEEM.2014.7058692

@inproceedings{30a2bf7535054d22a304530967460aa4,

title = "Scheduling a dynamic flowshop to minimize the mean absolute deviation from distinct due dates",

abstract = "A dynamic fowshop, where new job orders continuously arrive over the scheduling horizon, is considered in this study. The objective is to minimize the mean deviation from the due dates for the completed jobs. A cooperative dispatching approach is investigated for this objective, and its performance evaluated by comparison with other dispatching rules. The results from the comparative study indicate that the cooperative dispatching performs generally better than other dispatching rules for problems that are characterized by moderate to low due date tightness levels. In those instances where the jobs have moderately tight due dates, the cooperative dispatching approach produces mean absolute deviations that range between about 7 to 10% lower than the next best performing dispatching rule, across varying shop floor congestion levels.",

keywords = "Dispatching rules, due dates, flowshop",

author = "El-Bouri, {Ahmed W.}",

year = "2014",

doi = "10.1109/IEEM.2014.7058692",

language = "English",

volume = "2015-January",

pages = "521--525",

booktitle = "IEEM 2014 - 2014 IEEE International Conference on Industrial Engineering and Engineering Management",

publisher = "IEEE Computer Society",

note = "2014 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2014 ; Conference date: 09-12-2014 Through 12-12-2014",

}

TY - GEN

T1 - Scheduling a dynamic flowshop to minimize the mean absolute deviation from distinct due dates

AU - El-Bouri, Ahmed W.

PY - 2014

Y1 - 2014

N2 - A dynamic fowshop, where new job orders continuously arrive over the scheduling horizon, is considered in this study. The objective is to minimize the mean deviation from the due dates for the completed jobs. A cooperative dispatching approach is investigated for this objective, and its performance evaluated by comparison with other dispatching rules. The results from the comparative study indicate that the cooperative dispatching performs generally better than other dispatching rules for problems that are characterized by moderate to low due date tightness levels. In those instances where the jobs have moderately tight due dates, the cooperative dispatching approach produces mean absolute deviations that range between about 7 to 10% lower than the next best performing dispatching rule, across varying shop floor congestion levels.

AB - A dynamic fowshop, where new job orders continuously arrive over the scheduling horizon, is considered in this study. The objective is to minimize the mean deviation from the due dates for the completed jobs. A cooperative dispatching approach is investigated for this objective, and its performance evaluated by comparison with other dispatching rules. The results from the comparative study indicate that the cooperative dispatching performs generally better than other dispatching rules for problems that are characterized by moderate to low due date tightness levels. In those instances where the jobs have moderately tight due dates, the cooperative dispatching approach produces mean absolute deviations that range between about 7 to 10% lower than the next best performing dispatching rule, across varying shop floor congestion levels.

KW - Dispatching rules

KW - due dates

KW - flowshop

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

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

U2 - 10.1109/IEEM.2014.7058692

DO - 10.1109/IEEM.2014.7058692

M3 - Conference contribution

AN - SCOPUS:84988273934

VL - 2015-January

SP - 521

EP - 525

BT - IEEM 2014 - 2014 IEEE International Conference on Industrial Engineering and Engineering Management

PB - IEEE Computer Society

T2 - 2014 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2014

Y2 - 9 December 2014 through 12 December 2014

ER -

Scheduling a dynamic flowshop to minimize the mean absolute deviation from distinct due dates

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this