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

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)190-199
Number of pages10
JournalIEEJ Transactions on Electrical and Electronic Engineering
Volume9
Issue number2
DOIs
Publication statusPublished - 2014 Mar

Fingerprint

Resource allocation
Genetic algorithms
Scheduling
Experiments
Local search (optimization)

Keywords

  • Critical path improvement local search
  • Genetic algorithm
  • Iterative forward/backward local search
  • Precedence feasible activity list
  • Reduction procedure
  • Resource-constrained project scheduling problem with multiple modes

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

A genetic algorithm with local search using activity list characteristics for solving resource-constrained project scheduling problem with multiple modes. / Okada, Ikutaro; Takahashi, Koji; Zhang, Wenqiang; Zhang, Xiaofu; Yang, Hongyu; Fujimura, Shigeru.

In: IEEJ Transactions on Electrical and Electronic Engineering, Vol. 9, No. 2, 03.2014, p. 190-199.

Research output: Contribution to journalArticle

@article{9b2a204860404979ae8704088afa767f,
title = "A genetic algorithm with local search using activity list characteristics for solving resource-constrained project scheduling problem with multiple modes",
abstract = "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.",
keywords = "Critical path improvement local search, Genetic algorithm, Iterative forward/backward local search, Precedence feasible activity list, Reduction procedure, Resource-constrained project scheduling problem with multiple modes",
author = "Ikutaro Okada and Koji Takahashi and Wenqiang Zhang and Xiaofu Zhang and Hongyu Yang and Shigeru Fujimura",
year = "2014",
month = "3",
doi = "10.1002/tee.21955",
language = "English",
volume = "9",
pages = "190--199",
journal = "IEEJ Transactions on Electrical and Electronic Engineering",
issn = "1931-4973",
publisher = "John Wiley and Sons Inc.",
number = "2",

}

TY - JOUR

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

AU - Okada, Ikutaro

AU - Takahashi, Koji

AU - Zhang, Wenqiang

AU - Zhang, Xiaofu

AU - Yang, Hongyu

AU - Fujimura, Shigeru

PY - 2014/3

Y1 - 2014/3

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

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

KW - Critical path improvement local search

KW - Genetic algorithm

KW - Iterative forward/backward local search

KW - Precedence feasible activity list

KW - Reduction procedure

KW - Resource-constrained project scheduling problem with multiple modes

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

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

U2 - 10.1002/tee.21955

DO - 10.1002/tee.21955

M3 - Article

AN - SCOPUS:84896832947

VL - 9

SP - 190

EP - 199

JO - IEEJ Transactions on Electrical and Electronic Engineering

JF - IEEJ Transactions on Electrical and Electronic Engineering

SN - 1931-4973

IS - 2

ER -