Improvements to genetic algorithm for flexible job shop scheduling with overlapping in operations

Yiyong He, Wei Weng, Shigeru Fujimura

研究成果: Conference contribution

5 被引用数 (Scopus)

抄録

Flexible job-shop scheduling problem (FJSP) is an extended job-shop scheduling problem. FJSP allows an operation to be processed by several different machines. FJSP with overlapping in operations means that each operation is divided into several sublots. Sublots are processed and transferred separately without waiting for the entire operation to be processed. In previous research, a mathematical model was developed and a genetic algorithm proposed to solve this problem. In this study, we try to improve the procedure of previous research to achieve better results. The proposed improvements were tested on some benchmark problems and compared with the results obtained by previous research.

本文言語English
ホスト出版物のタイトルProceedings - 16th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2017
編集者Xiaohui Cui, Shaowen Yao, Simon Xu, Guobin Zhu
出版社Institute of Electrical and Electronics Engineers Inc.
ページ791-796
ページ数6
ISBN(電子版)9781509055074
DOI
出版ステータスPublished - 2017 6 27
イベント16th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2017 - Wuhan, China
継続期間: 2017 5 242017 5 26

出版物シリーズ

名前Proceedings - 16th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2017

Other

Other16th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2017
国/地域China
CityWuhan
Period17/5/2417/5/26

ASJC Scopus subject areas

  • 管理情報システム
  • 情報システム
  • 人工知能
  • コンピュータ ネットワークおよび通信
  • コンピュータ サイエンスの応用
  • ハードウェアとアーキテクチャ
  • 情報システムおよび情報管理
  • モデリングとシミュレーション

フィンガープリント

「Improvements to genetic algorithm for flexible job shop scheduling with overlapping in operations」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル