Lower Bounds for Resource Constrained Project Scheduling Problem - IMT Atlantique Accéder directement au contenu
Chapitre D'ouvrage Année : 2006

Lower Bounds for Resource Constrained Project Scheduling Problem

Résumé

We review the most recent lower bounds for the makespan minimization variant of the Resource Constrained Project Scheduling Problem. Lower bounds are either based on straight relaxations of the problems (e.g., single machine, parallel machine relaxations) or on constraint programming and/or linear programming formulations of the problem.
Fichier non déposé

Dates et versions

hal-00482953 , version 1 (12-05-2010)

Identifiants

Citer

Emmanuel Neron, Christian Artigues, Philippe Baptiste, Jacques Carlier, Jean Damay, et al.. Lower Bounds for Resource Constrained Project Scheduling Problem. J. Weglarz and J. Józefowska. Perspectives in modern project scheduling, 92, Springer-Verlag, pp.167-204, 2006, International Series in Operations Research and Management Science, 978-0-387-33643-5. ⟨10.1007/978-0-387-33768-5_7⟩. ⟨hal-00482953⟩
529 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More