A generic heuristic for multi-project scheduling problems with global and local resource constraints (RCMPSP)

2018 ◽  
Vol 23 (10) ◽  
pp. 3465-3479 ◽  
Author(s):  
Félix Villafáñez ◽  
David Poza ◽  
Adolfo López-Paredes ◽  
Javier Pajares ◽  
Ricardo del Olmo
Keyword(s):  
Project Scheduling ◽  
Resource Constraints ◽  
Scheduling Problems ◽  
Local Resource ◽  
Global And Local

scholarly journals On some implementations of solving the resource constrained project scheduling problems

2019 ◽  
Vol 29 (1) ◽  
pp. 31-42 ◽  
Author(s):  
E.Kh. Gimadi ◽  
E.N. Goncharov ◽  
D.V. Mishin
Keyword(s):  
Renewable Resources ◽  
Project Scheduling ◽  
Resource Constraints ◽  
Scheduling Problems ◽  
Makespan Minimization ◽  
Resource Constrained ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem ◽  
Technological Constraints

We consider a resource-constrained project scheduling problem with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. Activities pre- emptions are not allowed. The problem with renewable resources is NP-hard in the strong sense. We propose an exact branch and bound algorithm for solving the problem with renewable resources. It uses our new branching scheme based on the representation of a schedule in form of the activity list. We use two approaches of constructing the lower bound. We present results of numerical experiments, illustrating the quality of the proposed lower bounds. The test instances are taken from the library of test instances PSPLIB.

scholarly journals Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems

2017 ◽  
Author(s):  
Miquel Bofill ◽  
Jordi Coll ◽  
Josep Suy ◽  
Mateu Villaret
Keyword(s):  
Project Scheduling ◽  
Resource Constraints ◽  
Time Dependent ◽  
Scheduling Problems ◽  
Resource Constrained ◽  
Binary Decision ◽  
Compact Binary ◽  
Order Of Magnitude ◽  
Project Scheduling Problem ◽  
Multi Mode

Pseudo-Boolean (PB) constraints are usually encoded into Boolean clauses using compact Binary Decision Diagram (BDD) representations. Although these constraints appear in many problems, they are particularly useful for representing resource constraints in scheduling problems. Sometimes, the Boolean variables in the PB constraints have implicit at-most-one relations. In this work we introduce a way to take advantage of these implicit relations to obtain a compact Multi-Decision Diagram (MDD) representation for those PB constraints. We provide empirical evidence of the usefulness of this technique for some Resource-Constrained Project Scheduling Problem (RCPSP) variants, namely the Multi-Mode RCPSP (MRCPSP) and the RCPSP with Time-Dependent Resource Capacities and Requests (RCPSP/t). The size reduction of the representation of the PB constraints lets us decrease the number of Boolean variables in the encodings by one order of magnitude. We close/certify the optimum of many instances of these problems.

scholarly journals Discrete-continuous project scheduling with preemptable activities

2016 ◽  
Vol 64 (2) ◽  
pp. 383-393 ◽  
Author(s):  
R. Różycki ◽  
G. Waligóra ◽  
J. Węglarz
Keyword(s):  
Project Scheduling ◽  
Resource Constraints ◽  
Future Research ◽  
Scheduling Problems ◽  
Feasible Schedule ◽  
Project Duration ◽  
Processing Rate ◽  
Rate Functions ◽  
Continuous Resources ◽  
Increasing Function

Abstract In this paper, discrete-continuous project scheduling problems with preemptable activities are considered. In these problems, activities of a project simultaneously require discrete and continuous resources for their execution. The activities are preemptable, and the processing rate of each activity is a continuous, increasing function of the amount of a single continuous resource allotted to the activity at a time. The problem is to find a precedence- and discrete resource-feasible schedule and, simultaneously, continuous resource allocation that would minimize the project duration. Convex and concave processing rate functions are considered separately. We show that for convex functions the problem is simple, whereas for concave functions a special methodology has to be developed. We discuss the methodology for three cases of the problem: no discrete resource constraints, one discrete resource being a set of parallel, identical machines, and an arbitrary number of discrete resources. In each case we analyze separately independent and precedence-related activities. Some conclusions and directions for future research are given.

Using a Sliding-Frame Approach for Scheduling Large and Complex IT Projects

2011 ◽  
Vol 2 (4) ◽  
pp. 1-13 ◽  
Author(s):  
Yuval Cohen ◽  
Ofer Zwikael ◽  
Arik Sadeh
Keyword(s):  
Project Scheduling ◽  
Resource Constraints ◽  
Project Planning ◽  
Rolling Horizon ◽  
Scheduling Problems ◽  
It Projects ◽  
Software Projects ◽  
Project Duration ◽  
Software Companies ◽  
Planning And Management

Many IT projects and software development projects are very complex and sophisticated involving a large coordinated team. Such projects are a constant part of the operations of software companies such as Microsoft, SAP, Oracle, Google, Yahoo, IBM, and others. Many other companies carry large software projects as part of their IT operations. As a result of the size and complexity of such projects, a rolling horizon approach for their planning and management is not only plausible but also desirable. For large projects, traditional project scheduling techniques cannot provide an optimal and timely solution to minimum project duration under precedence and resource constraints. This paper proposes a technique that allows utilizing non-polynomial (NP) algorithms in a heuristic manner – generating high quality schedules in reasonable time. This approach can be applied efficiently for solving most project scheduling problems. The main advantage of this approach is its ability to dissect the original problem into small sub-problems of a controllable size to which exact techniques can be applied. Thus, it neutralizes the complexity of the applied algorithms (and their non-polynomial growth). Moreover, the same technique could be used for implementing a rolling-horizon approach in project planning and management.

Scheduling Large and Complex IT Projects Using Sliding-Frame Approach

2014 ◽  
pp. 1521-1533
Author(s):  
Yuval Cohen ◽  
Arik Sadeh ◽  
Ofer Zwikael
Keyword(s):  
Project Scheduling ◽  
Resource Constraints ◽  
Project Planning ◽  
Rolling Horizon ◽  
Scheduling Problems ◽  
It Projects ◽  
Software Projects ◽  
Project Duration ◽  
Software Companies ◽  
Planning And Management

Many IT projects and software development projects are very complex and sophisticated involving a large coordinated team. Such projects are a constant part of the operations of software companies such as Microsoft, SAP, Oracle, Google, Yahoo, IBM, and others. Many other companies carry large software projects as part of their IT operations. As a result of the size and complexity of such projects, a rolling horizon approach for their planning and management is not only plausible but also desirable. For large projects, traditional project scheduling techniques cannot provide an optimal and timely solution to minimum project duration under precedence and resource constraints. This paper proposes a technique that allows utilizing non-polynomial (NP) algorithms in a heuristic manner – generating high quality schedules in reasonable time. This approach can be applied efficiently for solving most project scheduling problems. The main advantage of this approach is its ability to dissect the original problem into small sub-problems of a controllable size to which exact techniques can be applied. Thus, it neutralizes the complexity of the applied algorithms (and their non-polynomial growth). Moreover, the same technique could be used for implementing a rolling-horizon approach in project planning and management.

Scheduling Large and Complex IT Projects Using Sliding-Frame Approach

2012 ◽  
pp. 173-185
Author(s):  
Yuval Cohen ◽  
Arik Sadeh ◽  
Ofer Zwikael
Keyword(s):  
Project Scheduling ◽  
Resource Constraints ◽  
Project Planning ◽  
Rolling Horizon ◽  
Scheduling Problems ◽  
It Projects ◽  
Software Projects ◽  
Project Duration ◽  
Software Companies ◽  
Planning And Management

Many IT projects and software development projects are very complex and sophisticated involving a large coordinated team. Such projects are a constant part of the operations of software companies such as Microsoft, SAP, Oracle, Google, Yahoo, IBM, and others. Many other companies carry large software projects as part of their IT operations. As a result of the size and complexity of such projects, a rolling horizon approach for their planning and management is not only plausible but also desirable. For large projects, traditional project scheduling techniques cannot provide an optimal and timely solution to minimum project duration under precedence and resource constraints. This paper proposes a technique that allows utilizing non-polynomial (NP) algorithms in a heuristic manner – generating high quality schedules in reasonable time. This approach can be applied efficiently for solving most project scheduling problems. The main advantage of this approach is its ability to dissect the original problem into small sub-problems of a controllable size to which exact techniques can be applied. Thus, it neutralizes the complexity of the applied algorithms (and their non-polynomial growth). Moreover, the same technique could be used for implementing a rolling-horizon approach in project planning and management.

Sign in / Sign up

Export Citation Format

Share Document