Project scheduling under partially renewable resources and resource consumption during setup operations

Okubo, Hironori; Murakami, Toshiyuki; Yoshida, Shizuo; Mori, K.; Kitamura, Shinji; Izui, Yoshio

doi:10.1016/j.cie.2015.02.006

Cited by 31 publications

(14 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Relations (7-9) define relations between the completion times of each pair of activities by each renewable resource. Equations (10) and (11) explain that a project activity will be carried out only by an executive level of renewable resource. Equation (12) guarantees that only one route out of the possible routes is selected for each flexible activity 2 J   .…”

Section: Mathematical Formulationmentioning

confidence: 99%

“…The project scheduling has attracted a lot of attention because of its critical role in the resource management as long as resource constrained project scheduling problem (RCPSP) is turned into a standard problem. RCPSP in classical viewpoint is defined as scheduling for a set of fixed activities with precedence constraints is known and must be implemented under the limited availability of resources to minimize the makespan [10,11]. RCPSP is a basic scheduling problem which comprises activities, scarce resources required by activities for their executions, and precedence relations between activities.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Designing a resource-constrained project scheduling model considering multiple routes for flexible project activities: meta-heuristic algorithms

2019

View full text Add to dashboard Cite

Resource constrained project scheduling problem with multiple routes for flexible project activities (RCPSP-MR) is a generalization of the RCPSP, in which for the implementation of each flexible activity in main structure of the project, several exclusive sub-networks are considered. Each sub-network is regarded as a route for the flexible activity. The routes are considered for each flexible activity that are varied in terms of: 1) Number of activities required to execute; 2) Precedence relationship between activates; 3) Allocation of different renewable and nonrenewable resources to each activity; and 4) Effectiveness on the duration and cost of project completion. In this paper, a new mathematical formulation of RCPSP-MR is firstly presented. Then, two solving approaches based on particle swarm optimization (PSO) and genetic algorithm (GA) are proposed to minimize costs of project completion. To evaluate the effectiveness of these proposed approaches, 50 problems (in very small, small, medium, and large-sized test problems) are designed and then are solved. Finally, comparisons are provided. Computational results show that the proposed GA generates high-quality solutions in a timely fashion. Keywords: Resource constrained project scheduling problem (RCPSP), flexible activities, multiple routes, particle swarm optimization (PSO), genetic algorithm (GA) 0,1, 2,..., 1 JN  1 J Set of total project fixed activities, 1 JJ  2 J Set of total flexible project activities, 21 J J J    Set of routes of each flexible activity 2 J   h  Set of total sub network for flexible activity

show abstract

Section: Mathematical Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Designing a resource-constrained project scheduling model considering multiple routes for flexible project activities: meta-heuristic algorithms

2019

View full text Add to dashboard Cite

show abstract

“…The first usage of this resource type can be found in Drexl et al (1993) for a course scheduling problem. Further examples are given in Drexl and Salewski (1997) for school timetabling, in Bartsch et al (2006) and Knust (2010) for sports scheduling, in Briskorn and Fliedner (2012) for container transshipment, and in Okubo et al (2015) for machine scheduling. The availability of a partially renewable resource is limited to an arbitrary set of periods.…”

Section: Introductionmentioning

confidence: 99%

A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints

Watermeyer

Zimmermann

2020

OR Spectrum

View full text Add to dashboard Cite

In this paper, we consider the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints. For the first time, the concept of partially renewable resources is embedded in the context of projects with general temporal constraints. While partially renewable resources have already broadened the area of applications for project scheduling, the extension by general temporal constraints allows to consider even more relevant aspects of real projects. We present a branch-and-bound procedure for the problem with the objective to minimize the project duration. To improve the performance of the solution procedure, new consistency tests, lower bounds, and dominance rules are developed. Furthermore, new temporal planning procedures, based on forbidden start times of activities, are presented which can be used for any project scheduling problem with general temporal constraints independent on the considered resource type. In a performance analysis, we compare our branch-and-bound procedure with the mixed-integer linear programming solver IBM CPLEX 12.8.0 on adaptations of benchmark instances from the literature. In addition, we compare our solution procedure with the only available branch-andbound procedure for partially renewable resources. The results of the computational experiments prove the efficiency of our branch-and-bound procedure.

show abstract

“…More recently, Okubo et al [23] proposed a model that can deal with energy consumption during the setup operation on the RCPSP by using partially renewable resources. Zhang et al [24] proposed a mathematical formulation for minimizing the energy consumption of a machining system by integrating planning and scheduling.…”

Section: Literature Reviewmentioning

confidence: 99%

A new model and metaheuristic approach for the energy-based resource-constrained scheduling problem

Morillo-Torres

Barber

Salido

2017

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

SAGE PublicationsMorillo-Torres, D.; Barber, F.; Salido, MA. (2017) instance, through a realistic mathematical model. This extension provides an alternative to the current trend of numerous researches about optimization and the manufacturing field, which require the inclusion of components to reduce the environmental impact in the decision-making process. PSPLIB-ENERGY is available at http://gps.webs.upv.es/psplib-energy/..

show abstract

Project scheduling under partially renewable resources and resource consumption during setup operations

Cited by 31 publications

References 21 publications

Designing a resource-constrained project scheduling model considering multiple routes for flexible project activities: meta-heuristic algorithms

Designing a resource-constrained project scheduling model considering multiple routes for flexible project activities: meta-heuristic algorithms

A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints

A new model and metaheuristic approach for the energy-based resource-constrained scheduling problem

Contact Info

Product

Resources

About