Applying Iterative Flattening Search to the Job Shop Scheduling Problem with Alternative Resources and Sequence Dependent Setup Times (Contributo in atti di convegno)

Type

• Contributo in atti di convegno (Classe)
• Prodotto della ricerca (Classe)

Label

• Applying Iterative Flattening Search to the Job Shop Scheduling Problem with Alternative Resources and Sequence Dependent Setup Times (Contributo in atti di convegno) (literal)

Anno

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

Alternative label

• Oddi, Angelo [1]; Rasconi, Riccardo [1]; Cesta, Amedeo [1]; Smith, Stephen F. [2] (2011)
  Applying Iterative Flattening Search to the Job Shop Scheduling Problem with Alternative Resources and Sequence Dependent Setup Times
  in Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems. Proceedings (COPLAS 2011), Freiburg, Germany, 13 June 2011
  (literal)

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

• Oddi, Angelo [1]; Rasconi, Riccardo [1]; Cesta, Amedeo [1]; Smith, Stephen F. [2] (literal)

Pagina inizio

• 15 (literal)

Pagina fine

• 22 (literal)

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

• ID_PUMA: cnr.istc/2011-A2-048 (literal)

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

• http://icaps11.icaps-conference.org/workshops/coplas.html (literal)

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

• [1] CNR-ISTC, Roma1-SanMartino; [2] CMU - Carnegie Mellon University, Robotics Institute (literal)

Titolo

• Applying Iterative Flattening Search to the Job Shop Scheduling Problem with Alternative Resources and Sequence Dependent Setup Times (literal)

Abstract

• This paper tackles a complex version of the Job Shop Scheduling Problem (JSSP) that involves both the possibility to select alternative resources to activities and the presence of sequence dependent setup times. The proposed solving strategy is a variant of the known Iterative Flattening Search (IFS) metaheuristic. This work presents the following contributions: (1) a new constraint-based solving procedure produced by means of enhancing a previous JSSP-solving version of the same metaheuristic; (2) a new version of both the variable and value ordering heuristics, based on temporal flexibility, that capture the relevant features of the extended scheduling problem (i.e., the flexibility in the assignment of resources to activities, and the sequence dependent setup times); (3) a new relaxation strategy based on the random selection of the activities that are closer to the critical path of the solution, as opposed to the original approach based on a fully random relaxation. The performance of the proposed algorithm are tested on a new benchmark set produced as an extension of an existing well-known testset for the Flexible Job Shop Scheduling Problem by adding sequence dependent setup times to each original testset's instance, and the behavior of the old and new relaxation strategies are compared. (literal)

Prodotto di

• Institute of cognitive sciences and technologies (ISTC) (Istituto)
• Pianificazione di interventi in situazione di emergenza: strumenti software e robotici (INT.P01.003.001) (Modulo)

Autore CNR

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

Insieme di parole chiave

• Parole chiave di "Applying Iterative Flattening Search to the Job Shop Scheduling Problem with Alternative Resources and Sequence Dependent Setup Times" (Insieme di parole chiave)

Incoming links:

Autore CNR di

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

Prodotto

• Institute of cognitive sciences and technologies (ISTC) (Istituto)
• Pianificazione di interventi in situazione di emergenza: strumenti software e robotici (INT.P01.003.001) (Modulo)

Insieme di parole chiave di

• Parole chiave di "Applying Iterative Flattening Search to the Job Shop Scheduling Problem with Alternative Resources and Sequence Dependent Setup Times" (Insieme di parole chiave)