Job Shop Scheduling with Routing Flexibility and Sequence-Dependent Setup Times (Contributo in atti di convegno)

Type

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

Label

• Job Shop Scheduling with Routing Flexibility 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)
  Job Shop Scheduling with Routing Flexibility and Sequence-Dependent Setup Times
  in 18th RCRA International Workshop on "Experimental Evaluation of Algorithms for solving problems with combinatorial explosion" (RCRA 2011), Barcelona, Spain, 17-18 July 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

• 96 (literal)

Pagina fine

• 110 (literal)

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

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

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

• https://docs.google.com/viewera=v&pid=explorer&chrome=true&srcid=0B8dEUbPKR1laMDRjNWYxN2EtZThiNi00Y2I0LWFlMjAtODQzYWI4MGVkZmE0&hl=en_US (literal)

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

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

Titolo

• Job Shop Scheduling with Routing Flexibility and Sequence-Dependent Setup Times (literal)

Abstract

• This paper presents a meta-heuristic algorithm for solving a job shop scheduling problem involving both sequence dependent setup-times and the possibility of selecting alternative routes among the available machines. The proposed strategy is a variant of the Iterative Flattening Search (IFS ) schema. This work provides three separate results: (1) a constraint-based solving procedure that extends an existing approach for classical Job Shop Scheduling; (2) a new variable and value ordering heuristic based on temporal flexibility that take into account both sequence dependent setup-times and flexibility in machine selection; (3) an original relaxation strategy based on the idea of randomly breaking the execution orders of the activities on the machines with a activity selection criteria based on their proximity to the solution's critical path. The efficacy of the overall heuristic optimization algorithm is demonstrated on a new benchmark set which is an extension of a well-known and difficult benchmark for the Flexible Job Shop Scheduling Problem. (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

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

Insieme di parole chiave

• Parole chiave di "Job Shop Scheduling with Routing Flexibility 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 "Job Shop Scheduling with Routing Flexibility and Sequence-Dependent Setup Times" (Insieme di parole chiave)