• 제목/요약/키워드: Resource-Constrained Project Scheduling

검색결과 40건 처리시간 0.039초

Term-Based Approach를 기초로한 자원제한프로젝트스케줄링 문제의 해결 (Solution of the Resource Constrained Project Scheduling Problem on the Foundation of a Term-Based Approach)

  • 김복선
    • 한국지능시스템학회논문지
    • /
    • 제24권2호
    • /
    • pp.218-224
    • /
    • 2014
  • The logic-based scheduling language RCPSV may be used to model resource-constrained project scheduling problems with variants for minimizing the project completion time. A diagram-based, nonredundant enumeration algorithm for the RCPSV-problem is proposed and the correctness of the algorithm is proved.

APPLYING ELITIST GENETIC ALGORITHM TO RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM

  • Jin-Lee Kim;Ok-Kyue Kim
    • 국제학술발표논문집
    • /
    • The 2th International Conference on Construction Engineering and Project Management
    • /
    • pp.739-748
    • /
    • 2007
  • The objective of this research study is to develop the permutation-based genetic algorithm for solving the resource-constrained project scheduling problem in construction engineering by incorporating elitism into genetic algorithm. A key aspect of the algorithm was the development of the elitist roulette selection operator to preserve the best individual solution for the next generation so the improved solution can be obtained. Another notable characteristic is the application of the parallel schedule generation scheme to generate a feasible solution to the problem. Case studies with a standard test problem were presented to demonstrate the performance and accuracy of the algorithm. The computational results indicate that the proposed algorithm produces reasonably good solutions for the resource-constrained project scheduling problem.

  • PDF

A PROACTIVE APPROACH FOR RESOURCE CONSTRAINED SCHEDULING OF MULTIPLE PROJECTS

  • Balasubramanian Kanagasabapathi;Kuppusamy Ananthanarayanan
    • 국제학술발표논문집
    • /
    • The 1th International Conference on Construction Engineering and Project Management
    • /
    • pp.744-747
    • /
    • 2005
  • The AEC (Architecture/Engineering/Construction) industry is facing a competitive world after it entered into the 21st century. Due to improper planning and scheduling, the construction projects face severe delays in completion. Most of the present day construction organisations operate in multiple project environments where more than one projects are to be managed simultaneously. But the advantages of planning and scheduling as multiple projects have not been utilized by these organisations. Change in multi-project planning and scheduling is inevitable and often frequent, therefore the traditional planning and scheduling approaches are no more feasible in scheduling multiple construction projects. The traditional scheduling tools like CPM and PERT do not offer any help in scheduling in a resource-constrained environment. This necessitated a detailed study to model the environment realistically and to make the allocation of limited resources flexible and efficient. This paper delineates about the proactive model which will help the project managers for scheduling the multiple construction projects.

  • PDF

자원제약하의 복수 프로젝트 일정계획을 위한 휴리스틱 알고리즘 (A Heuristic Algorithm for Resource-Constrained Multi - Project Scheduling)

  • 공명달;김정자
    • 산업공학
    • /
    • 제13권1호
    • /
    • pp.110-119
    • /
    • 2000
  • Resource-constrained project scheduling is to allocate limited resources to activities to optimize certain objective functions and to determine a start time for each activity in the project such that precedence constraints and resource requirements are satisfied. This study suggests a multi-project scheduling model which can level work loads, make the most of production capacity and restrain the delay of delivery by developing a heuristic algorithm which minimizes the project completion time and maximizes the load rate under resource constraints.

  • PDF

확률적 자원제약 스케줄링 문제 해결을 위한 가변 이웃탐색 기반 동적 의사결정 (Dynamic Decisions using Variable Neighborhood Search for Stochastic Resource-Constrained Project Scheduling Problem)

  • 임동순
    • 대한산업공학회지
    • /
    • 제43권1호
    • /
    • pp.1-11
    • /
    • 2017
  • Stochastic resource-constrained project scheduling problem is an extension of resource-constrained project scheduling problem such that activity duration has stochastic nature. In real situation where activity duration is not known until the activity is finished, open-loop based static policies such as activity-based policy and priority-based policy will not well cope with duration variability. Then, a dynamic policy based on closed-loop decision making will be regarded as an alternative toward achievement of minimal makespan. In this study, a dynamic policy designed to select activities to start at each decision time point is illustrated. The performance of static and dynamic policies based on variable neighborhood search is evaluated under the discrete-event simulation environment. Experiments with J120 sets in PSPLIB and several probability distributions of activity duration show that the dynamic policy is superior to static policies. Even when the variability is high, the dynamic policy provides stable and good solutions.

A new approach for resource allocation in project scheduling with variable-duration activities

  • 김수영;제진권;이상우
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
    • /
    • pp.410-420
    • /
    • 1994
  • In many project-oriented production systems, e.g., shipyards or large-scale steel products manufacturing, resource loading by an activity is flexible, and the activity duration is a function of resource allocation. For example, if one doubles the size of the crew assigned to perform an activity, it may be feasible to complete the activity in half the duration. Such flexibility has been modeled by Weglarz [131 and by Leachman, Dincerler, and Kim [7] in extended formulations of the resource-constrained project scheduling problem. This paper presents a new algorithmic approach to the problem that combines the ideas proposed by the aforementioned authors. The method we propose involves a two-step approach: (1) solve the resource-constrained scheduling problem using a heuristic, and (2) using this schedule as an initial feasible solution, find improved resource allocations by solving a linear programming model. We provide computational results indicating the superiority of this approach to previous methodology for the resource-constrained scheduling problem. Extensions to the model to admit overlap relationships of the activities also are presented.

자원제약을 고려하며 기간단축이 가능한 복수의 양식을 지닌 단일 프로젝트의 일정문제:자원 가용량이 시간에 따라 변하는 경우의 휴리스틱 기법 (Resource Constrained Project Scheduling Problem with Multiple Crashable Modes: A Heuristic Procedure for the Resource Availabilities Varying from Period to Period)

  • 안태호
    • 한국컴퓨터정보학회논문지
    • /
    • 제3권4호
    • /
    • pp.154-163
    • /
    • 1998
  • In this paper a heuristic procedure for a resource constrained project scheduling problem with multiple crashable modes is presented. A similar heuristic procedure by Ahn and Erengue was recently introduced, but the procedure assumes the resource capacities constant over the project life. The Procedure of this paper is able to deal with the resource capacities varying over the project life. The computational results with a set of 110 test problems demonstrate the efficacy of the heuristic procedure.

  • PDF

프로젝트 일정과 자원 평준화를 포함한 다목적 최적화 문제에서 순차적 자원 감소에 기반한 파레토 집합의 생성 (Generation of Pareto Sets based on Resource Reduction for Multi-Objective Problems Involving Project Scheduling and Resource Leveling)

  • 정우진;박성철;임동순
    • 산업경영시스템학회지
    • /
    • 제43권2호
    • /
    • pp.79-86
    • /
    • 2020
  • To make a satisfactory decision regarding project scheduling, a trade-off between the resource-related cost and project duration must be considered. A beneficial method for decision makers is to provide a number of alternative schedules of diverse project duration with minimum resource cost. In view of optimization, the alternative schedules are Pareto sets under multi-objective of project duration and resource cost. Assuming that resource cost is closely related to resource leveling, a heuristic algorithm for resource capacity reduction (HRCR) is developed in this study in order to generate the Pareto sets efficiently. The heuristic is based on the fact that resource leveling can be improved by systematically reducing the resource capacity. Once the reduced resource capacity is given, a schedule with minimum project duration can be obtained by solving a resource-constrained project scheduling problem. In HRCR, VNS (Variable Neighborhood Search) is implemented to solve the resource-constrained project scheduling problem. Extensive experiments to evaluate the HRCR performance are accomplished with standard benchmarking data sets, PSPLIB. Considering 5 resource leveling objective functions, it is shown that HRCR outperforms well-known multi-objective optimization algorithm, SPEA2 (Strength Pareto Evolutionary Algorithm-2), in generating dominant Pareto sets. The number of approximate Pareto optimal also can be extended by modifying weight parameter to reduce resource capacity in HRCR.

Resource-constrained Scheduling at Different Project Sizes

  • Lazari, Vasiliki;Chassiakos, Athanasios;Karatzas, Stylianos
    • 국제학술발표논문집
    • /
    • The 9th International Conference on Construction Engineering and Project Management
    • /
    • pp.196-203
    • /
    • 2022
  • The resource constrained scheduling problem (RCSP) constitutes one of the most challenging problems in Project Management, as it combines multiple parameters, contradicting objectives (project completion within certain deadlines, resource allocation within resource availability margins and with reduced fluctuations), strict constraints (precedence constraints between activities), while its complexity grows with the increase in the number of activities being executed. Due to the large solution space size, this work investigates the application of Genetic Algorithms to approximate the optimal resource alolocation and obtain optimal trade-offs between different project goals. This analysis uses the cost of exceeding the daily resource availability, the cost from the day-by-day resource movement in and out of the site and the cost for using resources day-by-day, to form the objective cost function. The model is applied in different case studies: 1 project consisting of 10 activities, 4 repetitive projects consisting of 40 activities in total and 16 repetitive projects consisting of 160 activities in total, in order to evaluate the effectiveness of the algorithm in different-size solution spaces and under alternative optimization criteria by examining the quality of the solution and the required computational time. The case studies 2 & 3 have been developed by building upon the recurrence of the unit/sub-project (10 activities), meaning that the initial problem is multiplied four and sixteen times respectively. The evaluation results indicate that the proposed model can efficiently provide reliable solutions with respect to the individual goals assigned in every case study regardless of the project scale.

  • PDF

유전자 알고리즘을 이용한 프로젝트 스케줄링에 관한 연구 (The Study on Project Scheduling Using Genetic Algorithm)

  • 이재현
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2009년도 추계학술대회
    • /
    • pp.735-737
    • /
    • 2009
  • 소프트 엔지니어링에서 프로젝트에 대한 효과적인 스케줄링은 중요한 부분 중에 하나이다. 산업에서는 한정된 자원에 대한 스케줄링을 가지는 다양한 방법이 시도 되고 있다. 본 논문에서는 유전자 알고리즘을 사용한 한정된 자원을 가지는 프로젝트 스케줄링에 대한 접근 방법을 제안하고, 실험 결과를 통하여 그 효과성을 입증한다.

  • PDF