Search for: resource-constrained-project-scheduling-problem
Article Journal of Uncertain Systems ; Vol.4, No.2, pp.123-132, 2010 ; Eshghi, Kourosh ; Eshragh Jahromi, Abdolhamid ; Sharif University of Technology
In this paper, first a fuzzy random resource-constrained project scheduling problem is presented. The object of the problem is to find the optimal scheduling of project activities. In this model, duration of project activities is a fuzzy random variable. Then, the proposed model is formulated by using the expected value of fuzzy random variables as an IP model. An illustrative example is also provided to clarify the concept. © 2010 World Academic Press, UK. All rights reserved
Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement, Article Mathematical Problems in Engineering ; Vol. 2014, issue , 2014 ; ISSN: 1024123X ; Shadrokh, S ; Fathi, Y ; Sharif University of Technology
A lot of projects in real life are subject to some kinds of nonrenewable resources that are not exactly similar to the type defined in the project scheduling literature. The difference stems from the fact that, in those projects, contrary to the common assumption in the project scheduling literature, nonrenewable resources are not available in full amount at the beginning of the project, but they are procured along the project horizon. In this paper, we study this different type of nonrenewable resources. To that end, we extend the resource constrained project scheduling problem (RCPSP) by this resource type (RCPSP-NR) and customize four basic branch and bound algorithms of RCPSP for it,...
Bi-objective resource constrained project scheduling problem with makespan and net present value criteria: Two meta-heuristic algorithms, Article International Journal of Advanced Manufacturing Technology ; Volume 69, Issue 1-4 , 2013 , Pages 617-626 ; 02683768 (ISSN) ; Najafi, A. A ; Niaki, S.T. A ; Sharif University of Technology
Traditionally, the model of a resource-constrained project-scheduling problem (RCPSP) contains a single objective function of either minimizing project makespan or maximizing project net present value (NPV). In order to be more realistic, in this paper, two multi-objective meta-heuristic algorithms of multi-population and two-phase sub-population genetic algorithms are proposed to find Pareto front solutions that minimize the project makespan and maximize the project NPV of a RCPSP, simultaneously. Based on standard test problems constructed by the RanGen project generator, a comprehensive computational experiment is performed, where response surface methodology is employed to tune the...
Resource-constrained project scheduling problem with flexible work profiles: A genetic algorithm approach, Article Scientia Iranica ; Volume 17, Issue 1 E , JANUARY-JUNE , 2010 , Pages 25-35 ; 10263098 (ISSN) ; Kianfar, F ; Sharif University of Technology
This paper deals with the resource-constrained project scheduling problem with flexible work profiles. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero. In many real-life projects, however, it often occurs that only one renewable bottleneck resource is available and that activities do not have, a fixed prespecified duration and associated resource requirement, but a total work content, which essentially indicates how much work has to be performed on them. Based on this work content, all feasible work profiles have to be specified for the activities, each characterized by a, fixed duration and a resource...
Article Scientia Iranica ; Volume 16, Issue 1 E , 2009 , Pages 11-18 ; 10263098 (ISSN) ; Kianfar, F ; Sharif University of Technology
In this paper, a new hybrid metaheuristic algorithm based on the scatter search approach is developed to solve the well-known resource-constrained project scheduling problem. This algorithm combines two solutions from scatter search to build a set of precedence feasible activity lists and select some of them as children for the new population. We use the idea presented in the iN forward/backward improvement technique to define two types of schedule, direct and reverse, and the members of the sequential populations change alternately between these two types of schedule. Extensive computational tests were performed on standard benchmark datasets and the results are compared with the best...
Article Mathematical Problems in Engineering ; Volume 2012 , 2012 ; 1024123X (ISSN) ; Kianfar, F ; Shirzadeh Chaleshtari, A ; Shadrokh, S ; Ranjbar, M ; Sharif University of Technology
We introduce a multimode resource-constrained project scheduling problem with finish-to-start precedence relations among project activities, considering renewable and nonrenewable resource costs. We assume that renewable resources are rented and are not available in all periods of time of the project. In other words, there is a mandated ready date as well as a due date for each renewable resource type so that no resource is used before its ready date. However, the resources are permitted to be used after their due dates by paying penalty costs. The objective is to minimize the total costs of both renewable and nonrenewable resource usage. This problem is called multimode resource-constrained...
An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem, Article Computers and Industrial Engineering ; Volume 62, Issue 1 , 2012 , Pages 264-270 ; 03608352 (ISSN) ; Khalilzadeh, M ; Kianfar, F ; Etminani, K ; Sharif University of Technology
We present an optimal solution procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. In this problem, we assume the constrained renewable resources are limited to very expensive equipments and machines that are used in other projects and are not available in all periods of time of a project. In other words, for each resource, there is a dictated ready date as well as a due date such that no resource can be available before its ready date but the resources are permitted to be used after their due dates by paying penalty cost depending on the resource type. We also assume that only one unit of each resource type is...
A hybrid genetic and Lagrangian relaxation algorithm for resource-constrained project scheduling under nonrenewable resources, Article Applied Soft Computing Journal ; Volume 94 , 2020 ; Shadrokh, S ; Khakifirooz, M ; Fathi, M ; Pardalos, P. M ; Sharif University of Technology
Elsevier Ltd 2020
Scheduling under nonrenewable resources is one of the challenging issues in project scheduling problems. There are many cases where the projects are subject to some nonrenewable resources. In most of the literature, nonrenewable resources are assumed to be available in full amount at the beginning of the project. However, in practice, it is prevalent that these resources are procured along the project horizon. This paper studies the generalized resource-constrained project scheduling problem (RCPSP) where, in addition to renewable resources, nonrenewable resources are considered, such as budget or consuming materials by the project activities. As the problem is NP-hard, some sub-algorithm...