A genetic algorithm with local search using activity list characteristics for solving resource-constrained project scheduling problem with multiple modes

Ikutaro Okada*, Koji Takahashi, Wenqiang Zhang, Xiaofu Zhang, Hongyu Yang, Shigeru Fujimura

*この研究の対応する著者

研究成果: Article査読

7 被引用数 (Scopus)

抄録

In this paper, we aim to solve the problem of resource-constrained project scheduling with multiple modes (rc-PSP/mM), in which multiple execution modes are available for each of the project's activity and with minimization of makespan as objective. We present a new genetic algorithm approach in order to solve this problem. In this procedure, we propose a new mutation operator that exploits a critical path and two new local search procedures, i.e. critical path improvement local search (cpiLS) and iterative forward/backward local search (ifbLS), using activity list characteristics. The cpiLS reduces the critical path and the ifbLS improves resource allocation of the schedule of rc-PSP/mM. Also, to evaluate the proposed approach, we compare the results of the computational experiment on certain standard project instances with the several competing heuristic procedures presented in the literature, and it has been revealed that our procedure is one of the most competitive among the algorithms.

本文言語English
ページ(範囲)190-199
ページ数10
ジャーナルIEEJ Transactions on Electrical and Electronic Engineering
9
2
DOI
出版ステータスPublished - 2014 3

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「A genetic algorithm with local search using activity list characteristics for solving resource-constrained project scheduling problem with multiple modes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル