A random key-based genetic algorithm approach for resource-constrained project scheduling problem with multiple modes

I. Okada, X. F. Zhang, H. Y. Yang, Shigeru Fujimura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

In the practice of scheduling of construction projects, there is a great variety of methods and procedures that need to be selected at each construction process during project. Accordingly, it is important to consider the different modes that may be selected for an activity in the scheduling of construction projects. In this study, first, we mathematically formulate the resource-constrained project scheduling problem with multiple modes while minimizing the total project time as the objective function. Following, we propose a new random key-based genetic algorithm approach which includes the mode reduction procedures to solve this NP-hard optimization problem. Finally, in order to evaluate the performance of our method, we are scheduled in the close future to implement the proposed approach on some standard project instances as the computational experiment and analyze these experimental results comparing with the bi-population-based genetic algorithm by Peteghem and Vanhoucke [1].

Original languageEnglish
Title of host publicationProceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010
Pages106-111
Number of pages6
Publication statusPublished - 2010
EventInternational MultiConference of Engineers and Computer Scientists 2010, IMECS 2010 - Kowloon
Duration: 2010 Mar 172010 Mar 19

Other

OtherInternational MultiConference of Engineers and Computer Scientists 2010, IMECS 2010
CityKowloon
Period10/3/1710/3/19

Fingerprint

Genetic algorithms
Scheduling
Experiments

Keywords

  • Bi-population-based genetic algorithm
  • Makespan
  • Random key-based genetic algorithm
  • Resource-constrained project scheduling problem

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Okada, I., Zhang, X. F., Yang, H. Y., & Fujimura, S. (2010). A random key-based genetic algorithm approach for resource-constrained project scheduling problem with multiple modes. In Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010 (pp. 106-111)

A random key-based genetic algorithm approach for resource-constrained project scheduling problem with multiple modes. / Okada, I.; Zhang, X. F.; Yang, H. Y.; Fujimura, Shigeru.

Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010. 2010. p. 106-111.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Okada, I, Zhang, XF, Yang, HY & Fujimura, S 2010, A random key-based genetic algorithm approach for resource-constrained project scheduling problem with multiple modes. in Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010. pp. 106-111, International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010, Kowloon, 10/3/17.
Okada I, Zhang XF, Yang HY, Fujimura S. A random key-based genetic algorithm approach for resource-constrained project scheduling problem with multiple modes. In Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010. 2010. p. 106-111
Okada, I. ; Zhang, X. F. ; Yang, H. Y. ; Fujimura, Shigeru. / A random key-based genetic algorithm approach for resource-constrained project scheduling problem with multiple modes. Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010. 2010. pp. 106-111
@inproceedings{c1b6a82f386b4c8e87f50a7053bee057,
title = "A random key-based genetic algorithm approach for resource-constrained project scheduling problem with multiple modes",
abstract = "In the practice of scheduling of construction projects, there is a great variety of methods and procedures that need to be selected at each construction process during project. Accordingly, it is important to consider the different modes that may be selected for an activity in the scheduling of construction projects. In this study, first, we mathematically formulate the resource-constrained project scheduling problem with multiple modes while minimizing the total project time as the objective function. Following, we propose a new random key-based genetic algorithm approach which includes the mode reduction procedures to solve this NP-hard optimization problem. Finally, in order to evaluate the performance of our method, we are scheduled in the close future to implement the proposed approach on some standard project instances as the computational experiment and analyze these experimental results comparing with the bi-population-based genetic algorithm by Peteghem and Vanhoucke [1].",
keywords = "Bi-population-based genetic algorithm, Makespan, Random key-based genetic algorithm, Resource-constrained project scheduling problem",
author = "I. Okada and Zhang, {X. F.} and Yang, {H. Y.} and Shigeru Fujimura",
year = "2010",
language = "English",
isbn = "9789881701282",
pages = "106--111",
booktitle = "Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010",

}

TY - GEN

T1 - A random key-based genetic algorithm approach for resource-constrained project scheduling problem with multiple modes

AU - Okada, I.

AU - Zhang, X. F.

AU - Yang, H. Y.

AU - Fujimura, Shigeru

PY - 2010

Y1 - 2010

N2 - In the practice of scheduling of construction projects, there is a great variety of methods and procedures that need to be selected at each construction process during project. Accordingly, it is important to consider the different modes that may be selected for an activity in the scheduling of construction projects. In this study, first, we mathematically formulate the resource-constrained project scheduling problem with multiple modes while minimizing the total project time as the objective function. Following, we propose a new random key-based genetic algorithm approach which includes the mode reduction procedures to solve this NP-hard optimization problem. Finally, in order to evaluate the performance of our method, we are scheduled in the close future to implement the proposed approach on some standard project instances as the computational experiment and analyze these experimental results comparing with the bi-population-based genetic algorithm by Peteghem and Vanhoucke [1].

AB - In the practice of scheduling of construction projects, there is a great variety of methods and procedures that need to be selected at each construction process during project. Accordingly, it is important to consider the different modes that may be selected for an activity in the scheduling of construction projects. In this study, first, we mathematically formulate the resource-constrained project scheduling problem with multiple modes while minimizing the total project time as the objective function. Following, we propose a new random key-based genetic algorithm approach which includes the mode reduction procedures to solve this NP-hard optimization problem. Finally, in order to evaluate the performance of our method, we are scheduled in the close future to implement the proposed approach on some standard project instances as the computational experiment and analyze these experimental results comparing with the bi-population-based genetic algorithm by Peteghem and Vanhoucke [1].

KW - Bi-population-based genetic algorithm

KW - Makespan

KW - Random key-based genetic algorithm

KW - Resource-constrained project scheduling problem

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

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

M3 - Conference contribution

AN - SCOPUS:79952379072

SN - 9789881701282

SP - 106

EP - 111

BT - Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, IMECS 2010

ER -