Genetic algorithm with critical path improvement strategy for solving project scheduling problem with multiple modes

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

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

Abstract

In this study, the resource-constrained project scheduling problem with multiple modes (rc-PSP/mM) minimizing the makespan as objective is treated, where an activity has different execution modes characterized by different duration and resource requirement combinations. To solve this NP-hard optimization problem, a novel activity list-based genetic algorithm is proposed. It includes the local search procedure using critical path for reduction of makespan of the schedule in rc-PSP/mM. In order to evaluate the performance, the proposed approach is implemented on some standard instances as the computational experiment and the results are compared with the several competitive heuristics in the literature.

Original languageEnglish
Title of host publication21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings
PublisherFraunhofer-Verlag
ISBN (Print)9783839602935
Publication statusPublished - 2011
Event21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Stuttgart
Duration: 2011 Jul 312011 Aug 4

Other

Other21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011
CityStuttgart
Period11/7/3111/8/4

Fingerprint

Genetic algorithms
Scheduling
Experiments
Local search (optimization)

Keywords

  • Activity list-based genetic algorithm
  • Critical path improvement procedure
  • Resource-constrained project scheduling problem with multiple modes

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Industrial and Manufacturing Engineering

Cite this

Okada, I., Zhang, X. F., Yang, H. Y., Zhang, W. Q., & Fujimura, S. (2011). Genetic algorithm with critical path improvement strategy for solving project scheduling problem with multiple modes. In 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings Fraunhofer-Verlag.

Genetic algorithm with critical path improvement strategy for solving project scheduling problem with multiple modes. / Okada, I.; Zhang, X. F.; Yang, H. Y.; Zhang, W. Q.; Fujimura, Shigeru.

21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag, 2011.

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

Okada, I, Zhang, XF, Yang, HY, Zhang, WQ & Fujimura, S 2011, Genetic algorithm with critical path improvement strategy for solving project scheduling problem with multiple modes. in 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag, 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011, Stuttgart, 11/7/31.
Okada I, Zhang XF, Yang HY, Zhang WQ, Fujimura S. Genetic algorithm with critical path improvement strategy for solving project scheduling problem with multiple modes. In 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag. 2011
Okada, I. ; Zhang, X. F. ; Yang, H. Y. ; Zhang, W. Q. ; Fujimura, Shigeru. / Genetic algorithm with critical path improvement strategy for solving project scheduling problem with multiple modes. 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings. Fraunhofer-Verlag, 2011.
@inproceedings{ef2ebc02d654422b8ed1256bc9513af5,
title = "Genetic algorithm with critical path improvement strategy for solving project scheduling problem with multiple modes",
abstract = "In this study, the resource-constrained project scheduling problem with multiple modes (rc-PSP/mM) minimizing the makespan as objective is treated, where an activity has different execution modes characterized by different duration and resource requirement combinations. To solve this NP-hard optimization problem, a novel activity list-based genetic algorithm is proposed. It includes the local search procedure using critical path for reduction of makespan of the schedule in rc-PSP/mM. In order to evaluate the performance, the proposed approach is implemented on some standard instances as the computational experiment and the results are compared with the several competitive heuristics in the literature.",
keywords = "Activity list-based genetic algorithm, Critical path improvement procedure, Resource-constrained project scheduling problem with multiple modes",
author = "I. Okada and Zhang, {X. F.} and Yang, {H. Y.} and Zhang, {W. Q.} and Shigeru Fujimura",
year = "2011",
language = "English",
isbn = "9783839602935",
booktitle = "21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings",
publisher = "Fraunhofer-Verlag",

}

TY - GEN

T1 - Genetic algorithm with critical path improvement strategy for solving project scheduling problem with multiple modes

AU - Okada, I.

AU - Zhang, X. F.

AU - Yang, H. Y.

AU - Zhang, W. Q.

AU - Fujimura, Shigeru

PY - 2011

Y1 - 2011

N2 - In this study, the resource-constrained project scheduling problem with multiple modes (rc-PSP/mM) minimizing the makespan as objective is treated, where an activity has different execution modes characterized by different duration and resource requirement combinations. To solve this NP-hard optimization problem, a novel activity list-based genetic algorithm is proposed. It includes the local search procedure using critical path for reduction of makespan of the schedule in rc-PSP/mM. In order to evaluate the performance, the proposed approach is implemented on some standard instances as the computational experiment and the results are compared with the several competitive heuristics in the literature.

AB - In this study, the resource-constrained project scheduling problem with multiple modes (rc-PSP/mM) minimizing the makespan as objective is treated, where an activity has different execution modes characterized by different duration and resource requirement combinations. To solve this NP-hard optimization problem, a novel activity list-based genetic algorithm is proposed. It includes the local search procedure using critical path for reduction of makespan of the schedule in rc-PSP/mM. In order to evaluate the performance, the proposed approach is implemented on some standard instances as the computational experiment and the results are compared with the several competitive heuristics in the literature.

KW - Activity list-based genetic algorithm

KW - Critical path improvement procedure

KW - Resource-constrained project scheduling problem with multiple modes

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

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

M3 - Conference contribution

AN - SCOPUS:84923429665

SN - 9783839602935

BT - 21st International Conference on Production Research: Innovation in Product and Production, ICPR 2011 - Conference Proceedings

PB - Fraunhofer-Verlag

ER -