IEEJ Transactions on Electronics, Information and Systems
Online ISSN : 1348-8155
Print ISSN : 0385-4221
ISSN-L : 0385-4221
<Softcomputing, Learning>
Robust Optimization Method based on Hybridization of GA and MMEDA for Resource Constraint Project Scheduling with Uncertainty
Jing TianXinchang HaoTomohiro Murata
Author information
JOURNAL FREE ACCESS

2017 Volume 137 Issue 7 Pages 957-966

Details
Abstract

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

Content from these authors
© 2017 by the Institute of Electrical Engineers of Japan
Previous article Next article
feedback
Top