Lower Bounds for Resource Constrained Project Scheduling Problem

Emmanuel Néron (), Christian Artigues (), Philippe Baptiste (), Jacques Carlier (), Jean Damay (), Sophie Demassey () and Philippe Laborie ()
Additional contact information
Emmanuel Néron: LI, Université François-Rabelais de Tours
Christian Artigues: Université d’Avignon el des Pays de Vaucluse
Philippe Baptiste: Ecole Polytechnique
Jacques Carlier: CNRS HeuDiaSyC, Université de Technologie de Compiègne
Jean Damay: Université Blaise Pascal
Sophie Demassey: Université de Montréal
Philippe Laborie: Ilog France

Chapter Chapter 7 in Perspectives in Modern Project Scheduling, 2006, pp 167-204 from Springer

Abstract: Abstract 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.

Keywords: Resource Constrained Project Scheduling Problem; lower bounds; constraint programming; linear programming (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-0-387-33768-5_7

Ordering information: This item can be ordered from
http://www.springer.com/9780387337685

DOI: 10.1007/978-0-387-33768-5_7

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().