Search-enhanced job dispatching in a dynamic permutation flowshop

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationIEEM 2015 - 2015 IEEE International Conference on Industrial Engineering and Engineering Management
PublisherIEEE Computer Society
Pages199-203
Number of pages5
Volume2016-January
ISBN (Electronic)9781467380669
DOIs
Publication statusPublished - Jan 18 2016
EventIEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2015 - Singapore, Singapore
Duration: Dec 6 2015Dec 9 2015

Other

OtherIEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2015
CountrySingapore
CitySingapore
Period12/6/1512/9/15

Fingerprint

Tabu search
Scheduling
Dispatching
Job search
Flow shop
Dispatching rules
Flow time

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

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 (Vol. 2016-January, pp. 199-203). [7385636] 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. Vol. 2016-January IEEE Computer Society, 2016. p. 199-203 7385636.

Research output: Chapter in Book/Report/Conference proceedingConference 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. vol. 2016-January, 7385636, 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
El-Bouri AW. Search-enhanced job dispatching in a dynamic permutation flowshop. In IEEM 2015 - 2015 IEEE International Conference on Industrial Engineering and Engineering Management. Vol. 2016-January. IEEE Computer Society. 2016. p. 199-203. 7385636 https://doi.org/10.1109/IEEM.2015.7385636
El-Bouri, Ahmed W. / Search-enhanced job dispatching in a dynamic permutation flowshop. IEEM 2015 - 2015 IEEE International Conference on Industrial Engineering and Engineering Management. Vol. 2016-January IEEE Computer Society, 2016. pp. 199-203
@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.}",
year = "2016",
month = "1",
day = "18",
doi = "10.1109/IEEM.2015.7385636",
language = "English",
volume = "2016-January",
pages = "199--203",
booktitle = "IEEM 2015 - 2015 IEEE International Conference on Industrial Engineering and Engineering Management",
publisher = "IEEE Computer Society",

}

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

VL - 2016-January

SP - 199

EP - 203

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

PB - IEEE Computer Society

ER -