한국컴퓨터정보학회논문지 (Journal of the Korea Society of Computer and Information)

  • 제20권9호
  • /
  • Pages.81-86
  • /
  • 2015
  • /
  • 1598-849X(pISSN)
  • /
  • 2383-9945(eISSN)
한국컴퓨터정보학회 (Korean Society of Computer Information)
권호 표지
DOI QR코드

DOI QR Code

Complete Time Algorithm for Stadium Construction Scheduling Problem

  • Lee, Sang-Un (Dept. of Multimedia Engineering, Gangneung-Wonju National University)
  • 투고 : 2015.07.14
  • 심사 : 2015.08.14
  • 발행 : 2015.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드

참고문헌

  1. C. Z. D. Santos, "Critical Path in Software Management," Interactive Systems & Consulting Inc, 2005.
  2. J. H. Kang, "COSC 621: Advanced Construction Project Scheduling and Management," Department of Construction Science, College of Architecture, Texas A&M University, 2005.
  3. C. Hendrickson, "Project Management for Construction: Fundamental Concepts for Owners, Engineers, Architects and Builders," http://www.ce.cmu.edu/pmbook/10_Fundamental_Scheduling_Procedures.html, 2003.
  4. C. Gueret, X. Prins, and M. Sevaux, "Applications of Optimization with Xpress-MP: 7.1 Construction of a Stadium," Dash Optimization Ltd., pp. 81-86, Feb. 2005.
  5. M. Rieberman and J. F. Hall, "Introduction to Economics; Chapter 6. How Firms make Decisions: Profit Maximization," 2ed, South-Western/Thomson Learning, 2005.
  6. K. James, "Critical Path Planning and Scheduling: Mathematical Basis," Operations Research, Vol. 9, No. 3, pp. 296-320, May 1961. https://doi.org/10.1287/opre.9.3.296
  7. M. Sniedovich, "Towards an AoA-Free Courseware for the Critical Path Method," INFORMS Transactions on Education, Vol. 5, No. 2, Jan. 2005.
  8. G. Lucko, "An Activity and Arrow Arranging Algorithm for Clarity in Schedule Network Diagrams," Joint International Conference on Computing and Decision Making in Civil and Building Engineering, pp. 752-761, Jun. 2006.
  9. Y. Cohen and A. Sadeh, "A New Approach for Constructing and Generating AOA Networks," Journal of Engineering, Computing and Architecture, Vol. 1, No. 1, pp. 1-13, Jan. 2007.
  10. N. R. Shankar and V. Sireesha, "Using Modified Dijkstra's Algorithm for Critical Path Method in a Project Network," International Journal of Computational and Applied Mathematics, Vol. 5, No. 2, pp. 217-225, Feb. 2010.