Project scheduling with flexible resources: formulation and inequalities

Authors:
Isabel Correia;Lídia Lampreia Lourenço;Francisco Saldanha-Da-Gama
Affiliations:
Departamento de Matemática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Caparica, Portugal 2829-516 and Centro de Matemática e Aplicações, Faculdade d ...;Departamento de Matemática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Caparica, Portugal 2829-516 and Centro de Investigação Operacional, Faculdade de Ci ...;Departamento de Estatística e Investigação Operacional, Faculdade de Ciências, Universidade de Lisboa, Lisboa, Portugal 1749-016 and Centro de Investigação Operaciona ...
Venue:
OR Spectrum
Year:
2012

Citing 9
Cited 1

An algorithm for solving the job-shop problem

Management Science
Characterization and generation of a general class of resource-constrained project scheduling problems

Management Science
Resource-constrained project scheduling: a survey of recent developments

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

Management Science
Project Scheduling Under Partially Renewable Resource Constraints

Management Science
A scatter search algorithm for project scheduling under partially renewable resources

Journal of Heuristics
A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem

INFORMS Journal on Computing
Event-based MILP models for resource-constrained project scheduling problems

Computers and Operations Research
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

A new multi-objective multi-mode model for solving preemptive time-cost-quality trade-off project scheduling problems

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study a variant of the resource-constrained project scheduling problem in which resources are flexible, i.e., each resource has several skills. Each activity in the project may need several resources for each required skill. We present a mixed-integer linear programming formulation for this problem. Several sets of additional inequalities are also proposed. Due to the fact that some of the above-mentioned inequalities require a valid upper bound to the problem, a heuristic procedure is proposed. Computational experience is reported based on randomly generated data, showing that for instances of reasonable size the proposed model enlarged with the additional inequalities can be solved efficiently.