• 국제학술발표논문집
• /
• 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.

• 경영과정보연구
• /
• 제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.

• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.181-195
• /
• 2006

Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language called RSV (resource constrained project scheduling with variant processes). We consider three different variants for formalizing the RSV-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the RSV- problem is NP-complete. Further we show that the optimizing variant (or number variant) of the RSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.

• 국제학술발표논문집
• /
• The 9th International Conference on Construction Engineering and Project Management
• /
• pp.608-615
• /
• 2022

Construction projects are large-scale projects that require extensive construction costs and resources. Especially, scheduling is considered as one of the essential issues for project success. However, the schedule and resource management are challenging to conduct in high-tech construction projects including complex design of MEP and architectural finishing which has to be constructed within a limited workspace and duration. In order to deal with such a problem, this study suggests resource and sequence optimization using constraint programming in construction projects. The optimization model consists of two modules. The first module is the data structure of the schedule model, which consists of parameters for optimization such as labor, task, workspace, and the work interference rate. The second module is the optimization module, which is for optimizing resources and sequences based on Constraint Programming (CP) methodology. For model validation, actual data of plumbing works were collected from a construction project using a five-minute rate (FMR) method. By comparing actual data and optimized results, this study shows the possibility of reducing the duration of plumbing works in construction projects. This study shows decreased overall project duration by eliminating work interference by optimizing resources and sequences within limited workspaces.

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

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

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 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.

• 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.

• 산업경영시스템학회지
• /
• 제22권52호
• /
• pp.297-309
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling(RCDMPS) is intended to minimize the total processing time(makespan) of two or more projects sequentially arriving at the shop under restricted resources. The aim of this paper is to develop the new Tabu Search heuristic for RCDMPS to minimize makespan. We propose the insertion method to generate the neighborhood solutions in applying the Tabu Search for the RCDMPS and the diversification strategy to search the solution space diversely. The proposed diversification strategy apply the dynamic tabu list that the tabu list size is generated and renewed at each iteration by the complexity of the project, and change the proposed tabu attribute. In this paper, We use the dynamic tabu list for the diversification strategy and intensification strategy in the tabu search, and compare with other dispatching heuristic method to verify that the new heuristic method minimize the makespan of the problem.