Master's Thesis Information Systems: Investment Project Evaluation and Automatic Project Management Scheduling

MINISTRY OF EDUCATION AND TRAINING

HAI PHONG PRIVATE UNIVERSITY

ISO 9001:2008

TRAN NHAT GIAP

MASTER'S THESIS IN INFORMATION SYSTEMS

Hai Phong - 2016

MINISTRY OF EDUCATION AND TRAINING

HAI PHONG PRIVATE UNIVERSITY

TRAN NHAT GIAP

INVESTMENT PROJECT EVALUATION AND

AUTOMATIC PROJECT MANAGEMENT SCHEDULE

MASTER'S THESIS IN INFORMATION TECHNOLOGY

MAJORITY: INFORMATION SYSTEM CODE: 60 48 01 04

SCIENTIFIC INSTRUCTOR: ASSOCIATE PROFESSOR, DR. NGUYEN VAN VY

INDEX

TABLE OF CONTENTS 1

ABBREVIATIONS 5

LIST OF FIGURES 6

LIST OF TABLES 8

ACKNOWLEDGEMENTS 8

COMMITMENT 9

INTRODUCTION 10

1. Problem statement 10

2. Research object and scope 11

2.1. Research subjects 11

2.2. Scope of research 11

3. Research direction of topic 12

4. Main research contents 12

5. Research methods 12

6. Scientific significance of topic 12

CHAPTER I: CURRENT STATE OF PROJECT MANAGEMENT AND SCHEDULE IN PROJECT MANAGEMENT 13

1.1. Overview of project management 13

1.1.1. Project Definition 13

1.1.2. General assessment for project selection 14

1.1.3. Economic feasibility assessment of the project 14

1.2. Project planning and scheduling problem 15

1.2.1. Project planning overview diagram 15

1.2.2. Difficulties of project planning and scheduling problem 18

1.2.3. Some software used for scheduling 18

CHAPTER II: FEASIBILITY ASSESSMENT AND MANUAL TIME SCHEDULE PLANNING 20

2.1. Economic feasibility assessment of the project 20

2.1.1. Diagram of economic feasibility assessment of project 20

2.1.2. Calculation of payback ratio and payback period 21

2.2. Planning the project schedule 23

2.2.1. Manual AOA network establishment algorithm 24

2.2.2. Conceptual diagram of the manual network establishment algorithm 26

2.2.3. Example of manual network establishment algorithm 29

2.2.4. Using the generated network to schedule the project 34

Chapter III: ALGORITHM DESIGN FOR AUTOMATIC PROJECT CALCULATION 37

3.1. Calculation of economic feasibility assessment of project 37

3.1.1. Parameters for calculating the return on investment 37

3.1.2. Structure of economic feasibility analysis spreadsheet 37

3.1.3. Example of economic feasibility analysis calculation 39

3.2. Transferring manual project planning algorithms to machine 40

3.2.1. General diagram of algorithm conversion to machine 40

3.2.2. Data structure table for project planning algorithm on machine 40

3.2.3. Algorithm design for AOA 42 network programming program

3.2.4. Logic diagram for calculating time parameters on AOA network 51

3.2.5. Logic diagram drawing charts of schedule plan 53

3.2.6. Introduction to the network programming for calendar planning 54

3.2.7. Some test examples using algorithm program 55

Chapter IV: BUILDING A PROJECT MANAGEMENT SUPPORT PROGRAM 60

4.1. Project management and operation problems and support programs 60

4.2. Physical data design for program 61

4.3. Introducing the project management support program 64

4.3.1. Menu system 64

4.3.2. Some main functions of the program and interface 65

4.3.3. An example of a specific project implementation with program 68

CONCLUSION 76

REFERENCES 78

APPENDIX 80

A. APPENDIX 1: Some calculation results of the 80 scheduling program

A1.1. Example 1 80

A1.2. Example 2 83

A1.3. Example 3 86

A1.4. Example 4 89

B. APPENDIX 2. Source code of project management support program 93

1. Part 1. Home 93

2. Part 2. Project Update 97

3. Part 3. Scheduling for Project 106

4. Part 4. System 118

5. Part 5. Logging in and out 121

LIST OF ABBREVIATIONS

Acronym

English words	Vietnamese Meaning
AOA	Ativities On Arcs (Network)	(network) Jobs are the supply
AON	Ativities On Notes (Network)	(network) Jobs are vertices
WBS	Work Breakdown Structure	Work breakdown table
CPM	Critical Path Method	Critical path method
PERT	Program Evaluation and Review Technique	Program Review and Evaluation Techniques (Network Diagram Method)

Maybe you are interested!

LIST OF FIGURES

Figure 1.1. General diagram of project planning 16

Figure 2.1: General diagram of project feasibility assessment process 20

Figure 2.1: Conceptual diagram identifying intermediate vertices 27

Figure 2.2: Conceptual diagram of the initial network drawing 28

Figure 2.3: Conceptual diagram of adding dummy jobs to the original network 29

Figure 2.4: AOA workflow network after completing step 4d 33

Figure 2.5: AOA workflow network after completing step 4 33

Figure 2.6: AOA workflow network after completing step 6 34

Figure 2.7: Work network with calculated time parameters 35

Figure 2.8: Gantt chart of the schedule plan of example 36

Figure 2.9. Resource (people) utilization chart of example 36

Figure 3.1: Diagram of the transition to network setup on machine 40

Figure 3.2: Diagram of steps to determine intermediate peaks 42

Figure 3.3: Find the smallest number of jobs in the unconsidered rows 43

Figure 3.4: Marking the work sets with the smallest CVDT 44

Figure 3.5: Delete marked work sets present in other sets 45

Figure 3.6. Network diagram: gradually identify the starting and ending points of the 46 jobs.

Figure 3.7: Add vertex 0 and draw jobs coming out of it 47

Figure 3.8a: Add intermediate vertex k and draw the work going out from k 47

Figure 3.8b: Add intermediate vertex k and draw the work going out from k 48

Figure 3.9: Algorithm diagram for drawing the end vertex of network 49

Figure 3.10: Algorithm diagram for renumbering the vertices of the network 49

Figure 3.11: Algorithm diagram for adding dummy jobs 50

Figure 3.12: Logic diagram for calculating the earliest start time of a vertex 51

Figure 3.13: Logic diagram for calculating the latest finish time of vertices 52

Figure 3.14: Logic diagram for calculating the backup time of job 52

Figure 3.15: Logic diagram of Gantt chart of project plan 53

Figure 3.16: Logic diagram plotting the project's resource usage. 54

Figure 3.17: Gantt chart of the schedule plan of example 58

Figure 3.18: Resource utilization chart of example 58

Figure 4.1: Project identification and implementation process 60

Figure 4.2: Menu system structure of program 64

Figure 4.3: Job definition analysis diagram 69

Figure 4.4: Gantt chart of the problem's planning schedule – version 1.00 72

Figure 4.5: Problem schedule resource utilization chart – version 1.00 72

Figure 4.6: Gantt chart of the problem plan schedule – version 1.01 75

Figure 4.7: Resource utilization chart of the problem schedule – version 1.01 75

Figure A1.1: Gantt chart of the schedule plan, example 1 82

Figure A1.2: Resource utilization chart of the schedule plan, example 1 82

Figure A2.1: Gantt chart of the schedule plan, example 2 85

Figure A2.2: Resource utilization chart of the schedule plan, example 1 85

Figure A3.1: Gantt chart of the schedule plan, example 3 88

Figure A3.2: Resource utilization chart of the schedule plan, example 3 88

Figure A4.1: Gantt chart of the schedule plan, example 4 91

Figure A4.2: Resource utilization chart of the schedule plan, example 4 92

LIST OF TABLES

Table 2.1: Work breakdown table 30

Table 2.2: Implementation of steps of phase 1 31

Table 2.3: Results of implementing the steps of phase 1 32

Table 2.4: Remaining work table after 4 repetitions of step 4 of phase 2. 32

Table 3.1. Calculation table of return on investment (cost-effectiveness analysis) 38

Table 3.2. Data structure table for the scheduling problem on machine 41

Table 3.3. Work function decomposition table (input) 56

Table 3.4. Table for determining intermediate peaks 56

Table 3.5. Table of time parameters of network vertices 57

Table 3.6. Work schedule and critical path 57

Table 3.7. Summary of test results of algorithm program 59

Table 4.0. Work decomposition table of problem 69

Table 4.1. Problem function decomposition table - version 1.00 70

Table 4.3. Table of start and end times of vertices-version 1.00 70

Table 4.4. Task execution schedule table of the problem-version 1.00 71

Table 4.5. Problem function decomposition table - version 1.01 73

Table 4.6. Intermediate calculation table of the problem - version 1.01 73

Table 4.7. Table of start and end times of vertices-version 1.01 74

Table 4.8. Work schedule table - version 1.01 74

Table A1.1. Example input data table 1 80

Table A1.2. Intermediate results for example 1 80

Table A1.3. Table of start and end times of vertices, example 1 81

Table A1.4. Work schedule table of example 1 81

Table A2.1. Example input data table 2 83

Table A2.2. Intermediate results of example 2 83

Table A2.3. Table of start and end times of vertices, example 2 84

Table A2.4. Work schedule table of example 2 84

Table A3.1. Example input data table 3 86

Table A3.2. Intermediate results of example 3 86

Table A3.3. Peak start and end times table, example 3 87

Table A3.4. Work schedule table of example 3 87

Table A4.1. Example input data table 4 89

Table A4.2. Intermediate results for example 4 90

Table A4.3. Peak start and end times, example 4 90

Table A4.4. Work schedule table of example 4 91

Master's Thesis Information Systems: Investment Project Evaluation and Automatic Project Management Scheduling - 1

Comment