Iterative Flattening Search on RCPSP/max Problems: Recent Developments (Contributo in volume (capitolo o saggio))

Type

• Prodotto della ricerca (Classe)
• Contributo in volume (capitolo o saggio) (Classe)

Label

• Iterative Flattening Search on RCPSP/max Problems: Recent Developments (Contributo in volume (capitolo o saggio)) (literal)

Anno

• 2009-01-01T00:00:00+01:00 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi

• 10.1007/978-3-642-03251-6_7 (literal)

Alternative label

• Angelo Oddi; Riccardo Rasconi (2009)
  Iterative Flattening Search on RCPSP/max Problems: Recent Developments
  Springer-Verlag Berlin, Berlin (Germania) in Recent Advances in Constraints 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, Rome, Italy, June 18-20, 2008, Revised Selected Papers, 2009
  (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

• Angelo Oddi; Riccardo Rasconi (literal)

Pagina inizio

• 99 (literal)

Pagina fine

• 115 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#titoloVolume

• Recent Advances in Constraints 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, Rome, Italy, June 18-20, 2008, Revised Selected Papers (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#volumeInCollana

• 5655/2009 (literal)

Note

• ISI Web of Science (WOS) (literal)
• Scopu (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

• Angelo Oddi; Riccardo Rasconi: Istituto di Scienze e Tecnologie dell Cognizione del CNR (literal)

Titolo

• Iterative Flattening Search on RCPSP/max Problems: Recent Developments (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn

• 3-642-03250-8 (literal)

Abstract

• This paper proposes an iterative improvement algorithm for solving instances of the Resource Constraint Project Scheduling Problem with Time-Windows (RCPSP/max). The algorithm is based on Iterative Flattening Search (ifs), an effective meta-heuristic strategy proposed over the past years for solving multi-capacity optimization scheduling problems. Given an initial solution, ifs iteratively applies two steps: (1) a subset of solving decisions are randomly retracted from a current solution (relaxation-step); (2) a new solution is incrementally recomputed (flattening-step). At the end, the best solution found is returned. To the best of our knowledge this is the first paper which proposes a version of ifs for solving RCPSP/max instances. The main contribution of this paper is threefold: (1) we succeed in improving 15 out of 90 solutions with respect to the officially published current best, thus demonstrating the general efficacy of ifs; (2) we highlight an intrisic limitation of the original ifs strategy in solving RCPSP/max, such that under certain circumstances the two-step improvement loop can get stuck in a status where no solving decision can be retracted; (3) we propose two different escaping strategies which extend the original ifs procedure. An experimental evaluation ends the paper, comparing the performances of the proposed escaping strategies against the original ifs procedure. (literal)

Editore

• Springer-Verlag Berlin (Editore)

Prodotto di

• Integrazione di ontologie e tecniche di programmazione a vincoli per la rappresentazione e gestione di workflow (INT.P02.013.001) (Modulo)
• Institute of cognitive sciences and technologies (ISTC) (Istituto)

Autore CNR

• RICCARDO RASCONI (Unità di personale interno)
• ANGELO ODDI (Persona)

Incoming links:

Autore CNR di

• ANGELO ODDI (Persona)
• RICCARDO RASCONI (Unità di personale interno)

Prodotto

• Institute of cognitive sciences and technologies (ISTC) (Istituto)
• Integrazione di ontologie e tecniche di programmazione a vincoli per la rappresentazione e gestione di workflow (INT.P02.013.001) (Modulo)

Editore di

• Springer-Verlag Berlin (Editore)