Arriving time control algorithm for dynamic flexible flow shop problem

C. Liu, Shigeru Fujimura, L. Y. Kang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper considers the dynamic flexible flow shop problem with unrelated parallel machines at each stage and the objective of the problem is to minimize the total earliness and tardiness penalties of all jobs, or to achieve weighted just in time. In previous studies, the job will never change if it has been assigned to a certain machine. Since the schedule should be updated according to the change of current stages, this paper proposes a mechanism that allows the selected machines to be updated for better schedule. Two kinds of arriving time control algorithms are developed. In addition, three improved ways are used to enhance the efficiency of the two algorithms. At last, these eight different approaches have been compared with two classic methods - the stage to stage feedback approach and the earliest to delivery dispatching rule and computational experiences reveal that the proposed approaches are efficient for the targeted problem.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010
Pages737-741
Number of pages5
DOIs
Publication statusPublished - 2010
Event17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010 - Xiamen
Duration: 2010 Oct 292010 Oct 31

Other

Other17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010
CityXiamen
Period10/10/2910/10/31

Fingerprint

Feedback

Keywords

  • Arriving time control algorithm
  • Dynamic flexible flow shop
  • Weighted just in time production

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

Liu, C., Fujimura, S., & Kang, L. Y. (2010). Arriving time control algorithm for dynamic flexible flow shop problem. In Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010 (pp. 737-741). [5646516] https://doi.org/10.1109/ICIEEM.2010.5646516

Arriving time control algorithm for dynamic flexible flow shop problem. / Liu, C.; Fujimura, Shigeru; Kang, L. Y.

Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010. 2010. p. 737-741 5646516.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Liu, C, Fujimura, S & Kang, LY 2010, Arriving time control algorithm for dynamic flexible flow shop problem. in Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010., 5646516, pp. 737-741, 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010, Xiamen, 10/10/29. https://doi.org/10.1109/ICIEEM.2010.5646516
Liu C, Fujimura S, Kang LY. Arriving time control algorithm for dynamic flexible flow shop problem. In Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010. 2010. p. 737-741. 5646516 https://doi.org/10.1109/ICIEEM.2010.5646516
Liu, C. ; Fujimura, Shigeru ; Kang, L. Y. / Arriving time control algorithm for dynamic flexible flow shop problem. Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010. 2010. pp. 737-741
@inproceedings{2d7fd4ae2a064e96b99d21e291ed831d,
title = "Arriving time control algorithm for dynamic flexible flow shop problem",
abstract = "This paper considers the dynamic flexible flow shop problem with unrelated parallel machines at each stage and the objective of the problem is to minimize the total earliness and tardiness penalties of all jobs, or to achieve weighted just in time. In previous studies, the job will never change if it has been assigned to a certain machine. Since the schedule should be updated according to the change of current stages, this paper proposes a mechanism that allows the selected machines to be updated for better schedule. Two kinds of arriving time control algorithms are developed. In addition, three improved ways are used to enhance the efficiency of the two algorithms. At last, these eight different approaches have been compared with two classic methods - the stage to stage feedback approach and the earliest to delivery dispatching rule and computational experiences reveal that the proposed approaches are efficient for the targeted problem.",
keywords = "Arriving time control algorithm, Dynamic flexible flow shop, Weighted just in time production",
author = "C. Liu and Shigeru Fujimura and Kang, {L. Y.}",
year = "2010",
doi = "10.1109/ICIEEM.2010.5646516",
language = "English",
isbn = "9781424464814",
pages = "737--741",
booktitle = "Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010",

}

TY - GEN

T1 - Arriving time control algorithm for dynamic flexible flow shop problem

AU - Liu, C.

AU - Fujimura, Shigeru

AU - Kang, L. Y.

PY - 2010

Y1 - 2010

N2 - This paper considers the dynamic flexible flow shop problem with unrelated parallel machines at each stage and the objective of the problem is to minimize the total earliness and tardiness penalties of all jobs, or to achieve weighted just in time. In previous studies, the job will never change if it has been assigned to a certain machine. Since the schedule should be updated according to the change of current stages, this paper proposes a mechanism that allows the selected machines to be updated for better schedule. Two kinds of arriving time control algorithms are developed. In addition, three improved ways are used to enhance the efficiency of the two algorithms. At last, these eight different approaches have been compared with two classic methods - the stage to stage feedback approach and the earliest to delivery dispatching rule and computational experiences reveal that the proposed approaches are efficient for the targeted problem.

AB - This paper considers the dynamic flexible flow shop problem with unrelated parallel machines at each stage and the objective of the problem is to minimize the total earliness and tardiness penalties of all jobs, or to achieve weighted just in time. In previous studies, the job will never change if it has been assigned to a certain machine. Since the schedule should be updated according to the change of current stages, this paper proposes a mechanism that allows the selected machines to be updated for better schedule. Two kinds of arriving time control algorithms are developed. In addition, three improved ways are used to enhance the efficiency of the two algorithms. At last, these eight different approaches have been compared with two classic methods - the stage to stage feedback approach and the earliest to delivery dispatching rule and computational experiences reveal that the proposed approaches are efficient for the targeted problem.

KW - Arriving time control algorithm

KW - Dynamic flexible flow shop

KW - Weighted just in time production

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

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

U2 - 10.1109/ICIEEM.2010.5646516

DO - 10.1109/ICIEEM.2010.5646516

M3 - Conference contribution

SN - 9781424464814

SP - 737

EP - 741

BT - Proceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010

ER -