• 국제학술발표논문집
• /
• The 1th International Conference on Construction Engineering and Project Management
• /
• pp.941-946
• /
• 2005

It is essential for project managers to make schedule adjustment based on their professional experience, in terms of rescheduling action discussed in this paper. This paper discusses the topics of resource-constrained construction rescheduling by modifying the concepts of manufacturing rescheduling. Moreover, the influence factors of construction rescheduling problems are investigated and identified in this paper. According to initial schedule plan and present progress, a new rescheduling mechanism based on Constraint Programming (CP) techniques is developed to reschedule projects with the objective of minimizing total project cost or duration, under three rescheduling policies. Through case study, the behavior of three different rescheduling policies is analyzed and discussed in this paper.

• 한국건설관리학회:학술대회논문집
• /
• 한국건설관리학회 2004년도 제5회 정기학술발표대회 논문집
• /
• pp.575-578
• /
• 2004

건설프로젝트는 일정한 기간 동안 주어진 목표를 수행하기 위한 작업들의 모임이라 정의할 수 있으며, 이를 위해서는 필요한 자원의 효율적 계획 및 관리가 필요하고, 이때 자원배당 및 자원평준화 기법이 활용된다. 하지만 자원제약이 있는 자원배당과 공기 제한이 있는 자원평준화 방법은 하나의 프로젝트에 개별적으로 적용되고 있어 전체 프로젝트의 공기와 효율적 자원이용 측면에서 적정화하기는 어렵다. 따라서 본 연구는 자원 평준화 방법의 Minimum Moment Algorithm 개념을 확대 $\cdot$ 적용하여 적정 자원이용 및 공사기간을 산출하고자 한다. 이때 자원 활용의 상태를 나타내는 5가지 지표들 사이의 중요도는 AHP기법을 통해 파악한다.

• 산업경영시스템학회지
• /
• 제14권23호
• /
• pp.19-25
• /
• 1991

In this paper, constrained resource project scheduling problems schedule project activities subject to finite constraints on the availability of non-storable resource. Further, resources are assumed to be available per period in constant amounts, and are also demanded by an activity in constant amounts throughout the duration of the activity. We describe formulation which minimizes the combined cost of fluctuations in resource demand and delay of project completion. Cost bounding procedures are augmented by dominance relationships presented as theorems. This paper presents algorithm for solving the problem. And numerical examples are presented. Sensitivity analysis to evaluate the effect of changes of cost efficients is conducted.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.343-352
• /
• 1993

In this study, a modified algorithm for the exchange heuristic is developed and applied to a resource-constrained scheduling problem. The problem involves multiple projects and multiple resource categories and allows flexible resource allocation to each activity. The objective is to minimize the maximum completion time. The exchange heuristkc is a multiple pass algorithm which makes improvements upon a given initial feasible schedule. Four different modified algorithms are proposed. The original algorithm and the new algorithms were compared through an experimental investigation. All the proposed algorithms reduce the maximum completion time much more effectively than the original algorithm. Especially, one of four proposed algorithms obviously outperforms the other three algorithms. The algorithm of the best performance produces significantly shorter schedules than the original algorithm, though it requires up to three times more computation time. However, in most situations, a reduction in schedule length means a significant reduction in the total cost.

• 국제학술발표논문집
• /
• The 4th International Conference on Construction Engineering and Project Management Organized by the University of New South Wales
• /
• pp.201-208
• /
• 2011

Today's highly competitive construction scenario forces all the major players in the field to take up multiple projects which have put an undue pressure on the resources available within the organization. Under such a situation, there are many instances where in the resource requirement exceeds its availability due to multiple activities (with same resource requirement) which are scheduled to start simultaneously and thus results in the constrained resource becoming a bottleneck of the project. As a consequence of sharing resources, this paper studies the impact on the completion date of two similar projects under two different conditions, the first one resulting in a postponed end date and the second without any postponement. The resource utilization, the possibility of substitution of a resource and its subsequent impact on the deadline of the project is analyzed under these two circumstances. The study is done on a Critical Chain Project Management (CCPM) platform instead of leaving the schedule with a traditional Critical Path Method (CPM) finish, which gives an added advantage of validating the robustness of the emerging CCPM trend in the field of resource management.

• Industrial Engineering and Management Systems
• /
• 제8권3호
• /
• pp.171-180
• /
• 2009

Population learning algorithm (PLA) is a population-based method that was inspired by the similarities to the phenomenon of social education process in which a diminishing number of individuals enter an increasing number of learning stages. The study aims to develop a framework that repeatedly applying the PLA to solve the discrete resource constrained project scheduling problem with two objectives: minimizing project makespan and renewable resource availability, which are two most common concerns of management when a project is being executed. The PLA looping framework will provide a number of near Pareto optimal schedules for the management to make a choice. Different improvement schemes and learning procedures are applied at different stages of the process. The process gradually becomes more and more sophisticated and time consuming as there are less and less individuals to be taught. An experiment with ProGen generated instances was conducted, and the results demonstrated that the looping framework using PLA outperforms those using genetic local search, particle swarm optimization with local search, scatter search, as well as biased sampling multi-pass algorithm, in terms of several performance measures of proximity. However, the diversity using spread metric does not reveal any significant difference between these five looping algorithms.

• 경영과정보연구
• /
• 제5권
• /
• pp.287-300
• /
• 2000

Project Managers want to reduce the cost and the completion time of the project simultaneously. But the project completion time tends to increase as the project cost is reduced, and the project cost has a tendency to increase as the project completion time is reduced. In this paper, the resource constrained project scheduling problem with multiple crashable modes is considered. An exact solution method for finding the efficient solution set and the computational results are introduced.

• 한국건설관리학회논문집
• /
• 제5권2호
• /
• pp.211-218
• /
• 2004

다수의 시설물을 보유한 기관에서는 유지보수와 리모델링(M/R) 프로젝트들이 동시에 진행되고 있다. 내부기능인력에 의해 프로젝트를 수행하는 자원제약 환경에서 프로젝트 관리자는 각 프로젝트의 완료일과 기관내 가용한 자원에 대한 제한을 고려하며 프로그램을 계획하고 관리하게 된다. 다중 자원제약 M/R 프로그램의 효과적 관리를 위해 이 논문은 장기적인 프로그램 계획축과 단기적인 일정창으로 구성되는 2단계 계층관리모델을 제안한다. 프로그램 플랜을 위한 연동계획기법은 연속되는 프로젝트 요청의 불확실성에 대처하기 위해 제안되었다. 일정창 속에서 마스터-일정계획을 수립하기 위해 개발된 PCR 일정계획 알고리즘은 M/R 프로그램에서의 작업반내 기능인력의 배치계획을 제공한다. 스프레드쉬트 인터페이스를 활용하여 M/R 프로그램의 일정계획 시스템을 개발하였고, 연속된 3개의 일정창으로 설계된 시뮬레이션 실험을 통해 개발된 일정계획 알고리즘과 기존의 자원제약 일정계획 휴리스틱의 성능을 비교하였다.

• 산업공학
• /
• 제13권2호
• /
• pp.225-233
• /
• 2000

In this paper, we develope a genetic algorithm for the erection scheduling in shipbuilding. Erection, the final manufacturing stage of shipbuilding, involves the landing and joining of blocks at drydock. Since several ships are built simultaneously at the same drydock and they compete with the common constrained production resource such as labor, space, and crane, we should consider both ship-specifics and common resource constraints for the desirable erection scheduling. Ship erection should also satisfy the predetermined dock cycle given from higher level production planning. Thus, erection schedule of a ship can be represented as a PERT/CPM project network with its own deadline. Since production resources are shared, the erection scheduling become the so-called multi-project scheduling problem with limited resources, which can not be solved easily due to the large size of project network. We propose a function as a minimization of load index which represented the load deviation over time horizon considering the yard production strategy. For the optical parameter setting, we tried various experiments. We verified that the proposed approach was effective to deal with the erection scheduling problem in shipbuilding.

• 한국건설관리학회논문집
• /
• 제5권5호
• /
• pp.135-142
• /
• 2004

본 연구에서는 바차트(bar chart) 기법과 CPM 기법의 장점을 결합한 CPM bar chart(CBC) 기법을 제시한다. CBC는 기존의 fenced bar chart(FBC)의 장점을 유지하면서 단점을 보완한 것으로, 작업 관계를 나타내는 fence에 방향성을 부여함으로써, 기존 FBC에서 상당한 혼란을 유발하는 fence의 분리과정 없이 작업들의 관계를 표현할 수 있다. 또한, fence의 분리를 파악하기 위해 더미작업(dummy activity)을 확인하는 과정이 생략되어 보다 손쉽게 작성할 수 있는 장점도 있다. 바차트의 간결성을 유지하면서 CPM의 네트워크 논리 표현이 가능해짐에 따라, CBC는 다양한 프로젝트 참여자들 간의 원활한 의사소통에 기여하리라 예상된다. 또한, resource constrained scheduling, resource leveling, 작업 분리가 고려된 일정 조정, 공기 지연 분석 등의 CPM 기법에 기초한 다양한 일정 계획 및 관리에도 적용이 용이하여, 실무뿐만이 아니라 공정관리 교육과정에서도 활용성이 높으리라 기대된다.