HUANG Shao-rong. Study on Multi-Mode Resource-Constrained Project Scheduling Problem Based on Genetic Algorithm[J]. Microelectronics & Computer, 2011, 28(9): 165-168.
Citation: HUANG Shao-rong. Study on Multi-Mode Resource-Constrained Project Scheduling Problem Based on Genetic Algorithm[J]. Microelectronics & Computer, 2011, 28(9): 165-168.

Study on Multi-Mode Resource-Constrained Project Scheduling Problem Based on Genetic Algorithm

  • To improve the Multi-Mode Resource-Constrained Project Scheduling Problem (MMRCPSP), based on constructed the mathematical model of MMRCPSP, a new genetic algorithm is proposed.The objective is to determine a mode and a start time for each activity such that all constraints are observed and the project duration is minimized.A special integer coding scheme is used in the algorithm, each gene represents the execution mode and the start time of an activity.By designing appropriate genetic operators, the proposed genetic algorithm is effective to solve this problem.The experimental result indicated the effectiveness of the algorithm.
  • loading

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return