Showing 9 results for Project Scheduling
M. Ranjbar ,
Volume 22, Issue 3 (9-2011)
Abstract
Project scheduling Net present value |
We consider a project scheduling problem with permitted tardiness and discrete time/resource trade-offs under maximum net present value objective. In this problem, a project consists of a set of sequential phases such that each phase contains one or more sub-projects including activities interrelated by finish-start-type precedence relations with a time lag of zero, which require one or more renewable resources. There is also a set of unconstrained renewable resources. For each activity, instead of a fixed duration and known resource requirements, a total work content respect to each renewable resource is given which essentially indicates how much work has to be performed on it. This work content can be performed in different modes, i.e. with different durations and resource requirements as long as the required work content is met. Based on the cost of resources units and resource requirements of each activity, there is a corresponding cash flow for the activity. Each phase is ended with a milestone that corresponds to the phase income. We prove that the mode corresponding to the minimum possible duration of each activity is the optimal mode in this problem. We also present a simple optima scheduling procedure to determine the finish time of each activity .
M. Ranjbar,
Volume 23, Issue 3 (9-2012)
Abstract
In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a due date for each resource such that no resource can be available before its ready date but the resources are allowed to be used after their due dates by paying penalty cost depending on the resource type. We also assume, there is only one unit of each resource type available and no activity needs more than it for execution. The goal is to find a schedule with minimal total weighted resource tardiness penalty costs. For this purpose, we present a hybrid metaheuristic procedure based on the greedy randomized adaptive search algorithm and path-relinking algorithm. We develop reactive and non-reactive versions of the algorithm. Also, we use different bias probability functions to make our solution procedure more efficient. The computational experiments show the reactive version of the algorithm outperforms the non-reactive version. Moreover, the bias probability functions defined based on the duration and precedence relation characteristics give better results than other bias probability functions.
Parham Azimi, Naeim Azouji,
Volume 28, Issue 4 (11-2017)
Abstract
In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current research. In this approach, the mathematical model of the main problem is relaxed and solved then the optimum solutions were used in the corresponding simulation model to produce several random feasible solutions for the main problem. Finally, the most promising solutions were selected as the initial population of a genetic Algorithm (GA). To test the efficiency of the problem, several test problems were solved by the proposed approach and according to the results, the proposed concept has a very good performance to solve such a complex combinatoral problem. Also, the concept could be easily applied for other similar combinatorics.
Siamak Noori, Kaveh Taghizadeh,
Volume 29, Issue 3 (9-2018)
Abstract
The Multi-Mode Resource Constrained Project Scheduling Problem (MMRCPSP) is one of the most important problems in project scheduling context. The MMRCPSP consists of activities to be scheduled subject to precedence and resource constraints. The effort needed in order to accomplish activities in the MMRCPSP is a discrete function of job performing modes. However, MMRCPSP is a basic model with a rather too restrictive assumptions to be applied practically. Therefore, there are many extensions over basic MMRCPSP model in terms of objective functions, resource constraints, and solving procedures. This research is aiming at fulfilling tow ambitions. First, to collect researches related MMRCPSP and to classify them based on a framework consisting of six distinct classes. Second, to indicate current trends and potential areas of future research. In order to fulfill the second goal a new mathematical method is proposed and applied which identify recent trends and gaps in a systematic manner.
Rana Imannezhad, Soroush Avakh Darestani,
Volume 29, Issue 3 (9-2018)
Abstract
Project scheduling problem with resources constraint is a well-known problem in the field of project management. The applicable nature of this problem has caused the researchers’ tendency to it. In this study, project scheduling with resource constraints and the possibility of interruption of project activities as well as renewable resources constraint has been also applied along with a case study on construction projects. Construction projects involve complex levels of work. Making wrong decisions in selecting methods and how to allocate the necessary resources such as manpower and equipment can lead to the results such as increasing the predetermined cost and time. According to NP-Hard nature of the problem, it is very difficult or even impossible to obtain optimal solution using optimization software and traditional methods. In project scheduling using CPM method, critical path is widely used; however, in this method, the resource constraints is not considered. Project Scheduling seek proper sequence for doing the project activities. This study has been conducted using Bees meta-heuristic algorithm, with the aim of optimizing the project completion time. Finally, the results obtained from three algorithms and GAMS software shows that this algorithm has better performance than and the solution among the other algorithms and has achieved the accurate solutions.
Parham Azimi, Shahed Sholekar,
Volume 32, Issue 1 (1-2021)
Abstract
According to the real projects’ data, activity durations are affected by numerous parameters. In this research, we have developed a multi-resource multi objective multi-mode resource constrained scheduling problem with stochastic durations where the mean and the standard deviation of activity durations are related to the mode in which each activity is performed. The objective functions of model were to minimize the net present value and makespan of the project. A simulation-based optimization approach was used to handle the problem with several stochastic events. This feature helped us to find several solutions quickly while there was no need to take simplification assumptions. To test the efficiency of the proposed algorithm, several test problems were taken from the PSPLIB directory and solved. The results show the efficiency of the proposed algorithm both in quality of the solutions and the speed.
Mojtaba Salehi, Efat Jabarpour,
Volume 32, Issue 3 (9-2021)
Abstract
Project scheduling is one of the most important and applicable concepts of project management. Many project-oriented companies and organizations apply variable cost reduction strategies in project implementation. Considering the current business environments, in addition to lowering their costs, many companies seek to prevent project delays. This paper presents a multi-objective fuzzy mathematical model for the problem of project scheduling with the limitation of multi-skilled resources able to change skills levels, optimizing project scheduling policy and skills recruitment. Given the multi objectivity of the model, the goal programming approach was used, and an equivalent single-objective model was obtained. Since the multi-skilled project scheduling is among the NP-Hard problems and the proposed problem is its extended state, so it is also an NP-Hard problem. Therefore, NSGA II and MOCS meta-heuristic algorithms were used to solve the large-sized model proposed using MATLAB software. The results show that the multi-objective genetic algorithm performs better than the multi-objective Cuckoo Search in the criteria of goal solution distance, spacing, and maximum performance enhancement.
Simin Dargahi Darabad, Maryam Izadbakhsh, Seyed Farid Ghannadpour, Siamak Noori, Mohammad Mahdavi Mazdeh,
Volume 35, Issue 1 (3-2024)
Abstract
The construction supply chain is presently the focus of considerable interest among numerous project-related businesses. Strong project management is essential for the effective completion of a project, since restricted budgets and time constraints are considered for each project. The research uses multi-objective linear programming to create a mathematical model of the building supply chain. The primary aims of the present investigation are to limit the expenses associated with logistics and to diminish the release of greenhouse gases caused by transportation. Given the reality of managing several projects concurrently, the model provided comprises a network of projects. Following the completion of each project, an inspection is arranged to assess its level of success. Estimating the costs of a project relies on several variables. In reality, there are always uncertainties highlighted in several studies about the uncertainty of cost and time parameters. This research incorporates many characteristics concurrently to simulate real-world settings and address the issue of uncertainty. The expression of uncertainty for all costs, activity length, inspection, supplier capacity, and resource demand are represented by triangular fuzzy numbers. Ultimately, the precision of the model's performance has been verified using a numerical illustration.
Ali Salmasnia, Elahe Heydarnezhad, Hadi Mokhtari,
Volume 35, Issue 2 (6-2024)
Abstract
Abstract. One of the important problems in managing construction projects is selecting the best alternative for activities' execution to minimize the project's total cost and time. However, uncertain factors often have negative effects on activity duration and cost. Therefore, it is crucial to develop robust approaches for construction project scheduling to minimize sensitivity to disruptive noise factors. Additionally, existing methods in the literature rarely focus on environmentally conscious construction management. Achieving these goals requires incorporating the project scheduling problem with multiple objectives. This study proposes a robust optimization approach to determine the optimal construction operations in a project scheduling problem, considering time, cost, and environmental impacts (TCE) as objectives. An analytical algorithm based on Benders decomposition is suggested to address the robust problem, taking into account the inherent uncertainty in activity time and cost. To evaluate the performance of the proposed solution approach, a computational study is conducted using real construction project data. The case study is based on the wall of the east coast of Amirabad port in Iran. The results obtained using the suggested solution approach are compared to those of the CPLEX solver, demonstrating the appropriate performance of the proposed approach in optimizing the time, cost, and environment trade-off problem.
