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
Japan
Kumamoto
期間16/7/1016/7/14

Fingerprint

Scheduling
Multiobjective optimization
Resource allocation
Experiments
Uncertainty
Local search (optimization)

ASJC Scopus subject areas

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

これを引用

Tian, J., & Murata, T. (2016). Robust scheduling for resource constraint scheduling problem by two-stage GA and MMEDA. : Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016 (pp. 1042-1047). [7557767] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IIAI-AAI.2016.99

Robust scheduling for resource constraint scheduling problem by two-stage GA and MMEDA. / Tian, Jing; Murata, Tomohiro.

Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1042-1047 7557767.

研究成果: Conference contribution

Tian, J & Murata, T 2016, Robust scheduling for resource constraint scheduling problem by two-stage GA and MMEDA. : Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016., 7557767, Institute of Electrical and Electronics Engineers Inc., pp. 1042-1047, 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016, Kumamoto, Japan, 16/7/10. https://doi.org/10.1109/IIAI-AAI.2016.99
Tian J, Murata T. Robust scheduling for resource constraint scheduling problem by two-stage GA and MMEDA. : Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 1042-1047. 7557767 https://doi.org/10.1109/IIAI-AAI.2016.99
Tian, Jing ; Murata, Tomohiro. / Robust scheduling for resource constraint scheduling problem by two-stage GA and MMEDA. Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 1042-1047
@inproceedings{0d835a421b824f42ab26f5fc4be14171,
title = "Robust scheduling for resource constraint scheduling problem by two-stage GA and MMEDA",
abstract = "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.",
keywords = "Estimation Distribution of Algorithm, Markov Network, Multi-objective, Resource Constrained Scheduling Problem, Robust Scheduling",
author = "Jing Tian and Tomohiro Murata",
year = "2016",
month = "8",
day = "31",
doi = "10.1109/IIAI-AAI.2016.99",
language = "English",
pages = "1042--1047",
booktitle = "Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

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

AU - Tian, Jing

AU - Murata, Tomohiro

PY - 2016/8/31

Y1 - 2016/8/31

N2 - 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.

AB - 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.

KW - Estimation Distribution of Algorithm

KW - Markov Network

KW - Multi-objective

KW - Resource Constrained Scheduling Problem

KW - Robust Scheduling

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

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

U2 - 10.1109/IIAI-AAI.2016.99

DO - 10.1109/IIAI-AAI.2016.99

M3 - Conference contribution

AN - SCOPUS:84988872612

SP - 1042

EP - 1047

BT - Proceedings - 2016 5th IIAI International Congress on Advanced Applied Informatics, IIAI-AAI 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -