Boosting the Performance of Iterative Flattening Search (Articolo in rivista)

Type
Label
  • Boosting the Performance of Iterative Flattening Search (Articolo in rivista) (literal)
Anno
  • 2007-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1007/978-3-540-74782-6_39 (literal)
Alternative label
  • Oddi, A., Policella, N., Cesta, A., and Smith, S.F. (2007)
    Boosting the Performance of Iterative Flattening Search
    in Lecture notes in computer science; Springer Berlin / Heildelberg, Berlin (Germania)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Oddi, A., Policella, N., Cesta, A., and Smith, S.F. (literal)
Pagina inizio
  • 447 (literal)
Pagina fine
  • 458 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://link.springer.com/chapter/10.1007/978-3-540-74782-6_39 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 4733 (literal)
Rivista
Note
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • ISTC-CNR (Cesta, Oddi) ESA (Policella) Carnegie Mellon University, USA (Smith) (literal)
Titolo
  • Boosting the Performance of Iterative Flattening Search (literal)
Abstract
  • Iterative Flattening search is a local search schema introduced for solving scheduling problems with a makespan minimization objective. It is an iterative two-step procedure, where on each cycle of the search a subset of ordering decisions on the critical path in the current solution are randomly retracted and then recomputed to produce a new solution. Since its introduction, other variations have been explored and shown to yield substantial performance improvement over the original formulation. In this spirit, we propose and experimentally evaluate further improvements to this basic local search schema. Specifically, we examine the utility of operating with a more flexible solution representation, and of integrating iterative-flattening search with a complementary tabu search procedure. We evaluate these extensions on large benchmark instances of the Multi-Capacity Job-Shop Scheduling Problem (MCJSSP) which have been used in previous studies of iterative flattening search procedures. (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Autore CNR di
Prodotto
Editore di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it