• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Branch-and-Cut-and-Price algorithms for the preemptive RCPSP

Fouilhoux, Pierre; Mahjoub, Ali Ridha; Quilliot, Alain; Toussaint, Hélène (2017), Branch-and-Cut-and-Price algorithms for the preemptive RCPSP, RAIRO - Operations Research, 52, 2, p. 513–528. 10.1051/ro/2018031

View/Open
Branch-and-Cut.pdf (458.9Kb)
Type
Article accepté pour publication ou publié
Date
2017
Journal name
RAIRO - Operations Research
Volume
52
Number
2
Pages
513–528
Publication identifier
10.1051/ro/2018031
Metadata
Show full item record
Author(s)
Fouilhoux, Pierre
Laboratoire d'Informatique de Paris 6 [LIP6]
Mahjoub, Ali Ridha
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Quilliot, Alain
Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes [LIMOS]
Toussaint, Hélène
Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes [LIMOS]
Abstract (EN)
In this article, we address the preemptive Resource-Constrained Precedence Scheduling Problem. We propose two mixed integer formulations containing an exponential number of variables and inequalities. An antichain is a set of pairwise incomparable elements with respect to the precedence constraints. In the first formulation, the integer variables are associated with the antichains. For the second, the integer variables are limited to a particular subset of antichains. We propose two Branch-and-Cut-and-Price algorithms for each of these formulations. We introduce some valid inequalities in order to reinforce the second formulation. Finally, we give some computational results on instances of the PSPLIB and compare the formulations.
Subjects / Keywords
Resource-constrained precedence scheduling problem; Preemptive case; Antichain; Branch-and-Cut-and-Price algorithm

Related items

Showing items related by title and author.

  • Thumbnail
    A Branch-Cut-and-Price Algorithm for the Location-Routing Problem 
    Pereira Vargas Liguori, Pedro Henrique; Mahjoub, Ali Ridha; Sadykov, Ruslan; Uchoa, Eduardo (2019) Communication / Conférence
  • Thumbnail
    The multilayer capacitated survivable IP network design problem: valid inequalities and branch-and-cut 
    Fouilhoux, Pierre; Klopkenstein, Olivier; Mahjoub, Ali Ridha; Borne, S. (2009) Communication / Conférence
  • Thumbnail
    Valid Inequalities and Branch-and-Cut Algorithm for the Constrained-Routing and Spectrum Assignment Problem 
    Diarrassouba, Ibrahima; Hadhbi, Youssouf; Mahjoub, Ali Ridha (2021) Document de travail / Working paper
  • Thumbnail
    Polyhedral Investigation and Branch-and-Cut Algorithm for the Spectrum Assignment Problem 
    Diarrassouba, Ibrahima; Hadhbi, Youssouf; Mahjoub, Ali Ridha (2022) Communication / Conférence
  • Thumbnail
    A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints 
    Borne, Sylvie; Mahjoub, Ali Ridha; Taktak, Raouia (2013) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo