경기장 건축 일정 문제의 종료시간 알고리즘

• Published in: 한국컴퓨터정보학회논문지, 20(9) pp. 81 - 86
• Main Author: 이상운
• Format: Journal Article
• Language: Korean
• Published: 한국컴퓨터정보학회 01.09.2015
• Subjects: 컴퓨터학
• ISSN: 1598-849X; 2383-9945

This paper suggests heuristic algorithm with linear time complexity to decide the normal and optimal point at minimum loss/maximum profit maximum shortest scheduling problem with additional loss cost and bonus profit cost. This algorithm computes only the earliest ending time for each node. Therefore, this algorithm can be get the critical path and project duration within O(n) time complexity and reduces the five steps of critical path method to one step. The proposed algorithm can be show the result more visually than linear programming and critical path method. For real experimental data, the proposed algorithm obtains the same solution as linear programming more quickly. KCI Citation Count: 0