研 究 生:黃逸帆 指導教授:葉榮懋 中華民國一百年三月

59
Southern Taiwan University Graduate Program of Industrial Management 結結結結結結結結結結 結結結 結結結結結結結結結結 Using Simulation and Genetic Algorith m to Solve The Scheduling Problem of Multiple Software Development Project s 結 結 結 結結結 結結結結 結結結 結結結結 結結結結 Southern Taiwan University Graduate Program of Industrial Management 結結結結結結 結結結結結結結

Upload: meda

Post on 14-Feb-2016

112 views

Category:

Documents


5 download

DESCRIPTION

Southern Taiwan University Graduate Program of Industrial Management. 南台科技大學 工業管理研究所. 結合模擬與基因演算法 求解軟體開發之多專案排程問題 Using Simulation and Genetic Algorithm to Solve The Scheduling Problem of Multiple Software Development Projects. 研 究 生:黃逸帆 指導教授:葉榮懋 中華民國一百年三月. 報告大綱. 緒論 文獻探討 研究方法 案例驗證 - PowerPoint PPT Presentation

TRANSCRIPT

  • Using Simulation and Genetic Algorithm to Solve The Scheduling Problem of Multiple Software Development Projects

  • (1/2)

  • (2/2)

  • Newman et al1987 Kerzner1990

  • Cleland & King 1983

    Lewis1998

  • Dispatching RuleMathematical ProgrammingHeuristic RuleGenetic AlgorithmSimulationArtificial Intelligence

  • (1/2)Putnum et al1971Holthaus & Rajendran1997Petroni & Rizzi2002

  • (2/2)

  • 1/2Law & Kelton 2000

  • 2/2Harrell et al1992

  • 1/2Law Kelton2000

  • 2/2Law Kelton2000

  • Visual Basic C++Java GPSS/HSLAM IISIMSCRIPT 11.5 AutoModArenaem-plant SLX

  • (1/3) Neumann1960

    Holland1975NeumannGenetic AlgorithmsGA--

  • (2/3)2000

  • (3/3)

  • 1998

    1999

  • Lawton1992

    Lawton1992

  • Lawton1992Srinivas1994SGA ,Holland 1975

  • (1/8)

  • (2/8)

    47

    14

  • (3/8)

  • (4/8)

  • (5/8)6444443

    4447

  • (6/7)

  • (7/8)

  • (8/8)

  • (1/4)Crystal Ball Hillier & Hillier 2003Crystal Ball

    Crystal Ball

  • (2/4)

    1000

  • (3/4)

  • (4/4)79.3711.4010004647 46.220.124760%40%47

  • 13

    4510000

  • A2

    C1

    B1

    A3

    C2

    E

    B2

    A4

    C3

    End

    A1

    F

    D

    B3

    Project 1

  • 6 ABCDEF6

  • PC = CT = DC = /DT = TLj = jRCj = jm =

  • LB21

    VLOOKUP64

  • Max

  • 1000A1B1C1D1E2F143103345

  • A2

    C1

    B1

    A3

    C2

    E

    B2

    A4

    C3

    End

    A1

    F

    D

    B3

    A2

    C1

    B1

    A3

    C2

    H

    B2

    A4

    C3

    End

    A1

    G

    I

    B3

    Project 1

    Project 2

  • A2

    C1

    B1

    A3

    C2

    E

    B2

    A4

    C3

    End

    A1

    F

    D

    B3

    A2

    C1

    B1

    A3

    C2

    H

    B2

    A4

    C3

    End

    A1

    G

    I

    B3

    Project 1

    Project 2

  • A2

    C1

    B1

    A3

    C2

    E

    B2

    A4

    C3

    End

    A1

    F

    D

    B3

    A2

    C1

    B1

    A3

    C2

    H

    B2

    A4

    C3

    End

    A1

    G

    I

    B3

    Project 1

    Project 2

  • A2

    C1

    B1

    A3

    C2

    E

    B2

    A4

    C3

    End

    A1

    F

    D

    B3

    A2

    C1

    B1

    A3

    C2

    H

    B2

    A4

    C3

    End

    A1

    G

    I

    B3

    Project 1

    Project 2