Arriving time control algorithm for dynamic flexible flow shop problem

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

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings - 2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010
ページ737-741
ページ数5
DOI
出版ステータスPublished - 2010 12 31
イベント17th International Conference on Industrial Engineering and Engineering Management, IE and EM2010 - Xiamen, China
継続期間: 2010 10 292010 10 31

出版物シリーズ

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

Conference

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

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

フィンガープリント 「Arriving time control algorithm for dynamic flexible flow shop problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル