Search-enhanced job dispatching in a dynamic permutation flowshop

Ahmed W. El-Bouri

doi:10.1109/IEEM.2015.7385636

Search-enhanced job dispatching in a dynamic permutation flowshop

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 flowshop that continuously receives jobs at random points in time is considered, with the objective of scheduling the jobs in an order that minimizes the mean flowtime. A tabu search is proposed for deciding which job to dispatch next to the flowshop, and the approach is then compared by means of a computational analysis with a number of other competing dispatching rules. The results demonstrate that the search-enhanced dispatching method achieves reductions of between 13% and 17% in the mean flowtimes in comparison to the other dispatching rules. However, the proposed method is not as competitive in comparison to a more complex cooperative dispatching approach when shop congestion levels are medium to low.

Original language	English
Title of host publication	IEEM 2015 - 2015 IEEE International Conference on Industrial Engineering and Engineering Management
Publisher	IEEE Computer Society
Pages	199-203
Number of pages	5
ISBN (Electronic)	9781467380669
DOIs	https://doi.org/10.1109/IEEM.2015.7385636
Publication status	Published - Jan 18 2016
Event	IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2015 - Singapore, Singapore Duration: Dec 6 2015 → Dec 9 2015

Publication series

Name	IEEE International Conference on Industrial Engineering and Engineering Management
Volume	2016-January
ISSN (Print)	2157-3611
ISSN (Electronic)	2157-362X

Other

Other	IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2015
Country/Territory	Singapore
City	Singapore
Period	12/6/15 → 12/9/15

Keywords

dispatching rules
flowshop
flowtime
tabu search

ASJC Scopus subject areas

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

Access to Document

10.1109/IEEM.2015.7385636

Cite this

El-Bouri, A. W. (2016). Search-enhanced job dispatching in a dynamic permutation flowshop. In IEEM 2015 - 2015 IEEE International Conference on Industrial Engineering and Engineering Management (pp. 199-203). Article 7385636 (IEEE International Conference on Industrial Engineering and Engineering Management; Vol. 2016-January). IEEE Computer Society. https://doi.org/10.1109/IEEM.2015.7385636

Search-enhanced job dispatching in a dynamic permutation flowshop. / El-Bouri, Ahmed W.
IEEM 2015 - 2015 IEEE International Conference on Industrial Engineering and Engineering Management. IEEE Computer Society, 2016. p. 199-203 7385636 (IEEE International Conference on Industrial Engineering and Engineering Management; Vol. 2016-January).

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

El-Bouri, AW 2016, Search-enhanced job dispatching in a dynamic permutation flowshop. in IEEM 2015 - 2015 IEEE International Conference on Industrial Engineering and Engineering Management., 7385636, IEEE International Conference on Industrial Engineering and Engineering Management, vol. 2016-January, IEEE Computer Society, pp. 199-203, IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2015, Singapore, Singapore, 12/6/15. https://doi.org/10.1109/IEEM.2015.7385636

@inproceedings{62f4fa9298e645088468354686c12b46,

title = "Search-enhanced job dispatching in a dynamic permutation flowshop",

abstract = "A dynamic flowshop that continuously receives jobs at random points in time is considered, with the objective of scheduling the jobs in an order that minimizes the mean flowtime. A tabu search is proposed for deciding which job to dispatch next to the flowshop, and the approach is then compared by means of a computational analysis with a number of other competing dispatching rules. The results demonstrate that the search-enhanced dispatching method achieves reductions of between 13% and 17% in the mean flowtimes in comparison to the other dispatching rules. However, the proposed method is not as competitive in comparison to a more complex cooperative dispatching approach when shop congestion levels are medium to low.",

keywords = "dispatching rules, flowshop, flowtime, tabu search",

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

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2015 ; Conference date: 06-12-2015 Through 09-12-2015",

year = "2016",

month = jan,

day = "18",

doi = "10.1109/IEEM.2015.7385636",

language = "English",

series = "IEEE International Conference on Industrial Engineering and Engineering Management",

publisher = "IEEE Computer Society",

pages = "199--203",

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

}

TY - GEN

T1 - Search-enhanced job dispatching in a dynamic permutation flowshop

AU - El-Bouri, Ahmed W.

PY - 2016/1/18

Y1 - 2016/1/18

N2 - A dynamic flowshop that continuously receives jobs at random points in time is considered, with the objective of scheduling the jobs in an order that minimizes the mean flowtime. A tabu search is proposed for deciding which job to dispatch next to the flowshop, and the approach is then compared by means of a computational analysis with a number of other competing dispatching rules. The results demonstrate that the search-enhanced dispatching method achieves reductions of between 13% and 17% in the mean flowtimes in comparison to the other dispatching rules. However, the proposed method is not as competitive in comparison to a more complex cooperative dispatching approach when shop congestion levels are medium to low.

AB - A dynamic flowshop that continuously receives jobs at random points in time is considered, with the objective of scheduling the jobs in an order that minimizes the mean flowtime. A tabu search is proposed for deciding which job to dispatch next to the flowshop, and the approach is then compared by means of a computational analysis with a number of other competing dispatching rules. The results demonstrate that the search-enhanced dispatching method achieves reductions of between 13% and 17% in the mean flowtimes in comparison to the other dispatching rules. However, the proposed method is not as competitive in comparison to a more complex cooperative dispatching approach when shop congestion levels are medium to low.

KW - dispatching rules

KW - flowshop

KW - flowtime

KW - tabu search

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

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

U2 - 10.1109/IEEM.2015.7385636

DO - 10.1109/IEEM.2015.7385636

M3 - Conference contribution

AN - SCOPUS:84962019048

T3 - IEEE International Conference on Industrial Engineering and Engineering Management

SP - 199

EP - 203

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

PB - IEEE Computer Society

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

Y2 - 6 December 2015 through 9 December 2015

ER -

Search-enhanced job dispatching in a dynamic permutation flowshop

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this