An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

Authors:
Aristide Mingozzi;Vittorio Maniezzo;Salvatore Ricciardelli;Lucio Bianco
Affiliations:
-;-;-;-
Venue:
Management Science
Year:
1998

Citing 0
Cited 31

Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A Term-Based Approach to Project Scheduling

ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Scheduling and constraint propagation

Discrete Applied Mathematics
Solving Project Scheduling Problems by Minimum Cut Computations

Management Science
Software project management with GAs

Information Sciences: an International Journal
Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem

INFORMS Journal on Computing
A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem

INFORMS Journal on Computing
A random key based genetic algorithm for the resource constrained project scheduling problem

Computers and Operations Research
Preemptive scheduling and antichain polyhedra

Discrete Applied Mathematics
On project scheduling problem

Automation and Remote Control
Benders decomposition, Lagrangean relaxation and metaheuristic design

Journal of Heuristics
An efficient hybrid algorithm for resource-constrained project scheduling

Information Sciences: an International Journal
Improving iterative repair strategies for scheduling with the SVM

Neurocomputing
Integrated requirement selection and scheduling for the release planning of a software product

REFSQ'07 Proceedings of the 13th international working conference on Requirements engineering: foundation for software quality
Hybrid local search techniques for the resource-constrained project scheduling problem

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Event-based MILP models for resource-constrained project scheduling problems

Computers and Operations Research
A Neurogenetic approach for the resource-constrained project scheduling problem

Computers and Operations Research
Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources

Computational Optimization and Applications
New concepts for activity float in resource-constrained project management

Computers and Operations Research
An Artificial Immune Algorithm for the project scheduling problem under resource constraints

Applied Soft Computing
On the performance of bee algorithms for resource-constrained project scheduling problem

Applied Soft Computing
Tight complexity analysis of the relocation problem with arbitrary release dates

Theoretical Computer Science
A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem

Journal of Heuristics
Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm

Expert Systems with Applications: An International Journal
Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills

PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements

Discrete Optimization
Project scheduling with flexible resources: formulation and inequalities

OR Spectrum
Solving resource-constrained project scheduling problems: Conceptual validation of FLP formulation and efficient permutation-based ABC computation

Computers and Operations Research
Integrating iterative crossover capability in orthogonal neighborhoods for scheduling resource-constrained projects

Evolutionary Computation
A New Genetic Algorithm for the RCPSP in Large Scale

International Journal of Applied Evolutionary Computation
Decomposing combinatorial auctions and set packing problems

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we consider the Project Scheduling Problem with resource constraints, where the objective is to minimize the project makespan. We present a new 0-1 linear programming formulation of the problem that requires an exponential number of variables, corresponding to all feasible subsets of activities that can be simultaneously executed without violating resource or precedence constraints. Different relaxations of the above formulation are used to derive new lower bounds, which dominate the value of the longest path on the precedence graph and are tighter than the bound proposed by Stinson et al. (1978). A tree search algorithm, based on the above formulation, that uses new lower bounds and dominance criteria is also presented. Computational results indicate that the exact algorithm can solve hard instances that cannot be solved by the best algorithms reported in the literature.