Robust scheduling for resource constraint scheduling problem by two-stage GA and MMEDA

Jing Tian, Tomohiro Murata

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

Inspired by the cooperative co-evolutionary paradigm, this paper presents a two-stage algorithm hybrid generic algorithm (GA) and multi-objective Markov network based EDA (MMEDA), to solve the robust scheduling problem for resource constrained scheduling problem (RCSP) with uncertainty. In the first stage, GA is used to find feasible solution for sequencing sub-problem, and in the second stage, MMEDA is adopted to model the interrelation for resource allocation and calculate the Pareto set for multi-objective optimization problems. One problem-specific local search with considering both makespan and robustness is designed to increase the solution quality. Experiment results based on a benchmark and comparisons demonstrate that our approach is highly effective and tolerant of uncertainty.

本文言語English
ホスト出版物のタイトルProceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016
出版社Institute of Electrical and Electronics Engineers Inc.
ページ1042-1047
ページ数6
ISBN(電子版)9781467389853
DOI
出版ステータスPublished - 2016 8 31
イベント5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016 - Kumamoto, Japan
継続期間: 2016 7 102016 7 14

Other

Other5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016
CountryJapan
CityKumamoto
Period16/7/1016/7/14

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Computer Science Applications
  • Computer Vision and Pattern Recognition

フィンガープリント 「Robust scheduling for resource constraint scheduling problem by two-stage GA and MMEDA」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル