Solving the flow shop scheduling problem under evolutionary approaches

The flow shop scheduling problem (FSSP) [12], has held the attention of many researchers. In a simplest usual situation, a set of jobs must follow the same route to be executed on a set of machines (resources) and the main objective is to optimize some performance variable (makespan, tardiness, late...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Vilanova, Gabriela, Pandolfi, Daniel, San Pedro, María Eugenia de, Villagra, Andrea, Bain, María Elena, Gallard, Raúl Hector
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2001
Materias:
Ciencias Informáticas
Solving the flow shop scheduling problem
evolutionary approaches
Scheduling
ARTIFICIAL INTELLIGENCE
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/21670
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-21670
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Solving the flow shop scheduling problem
evolutionary approaches
Scheduling
ARTIFICIAL INTELLIGENCE
spellingShingle Ciencias Informáticas
Solving the flow shop scheduling problem
evolutionary approaches
Scheduling
ARTIFICIAL INTELLIGENCE
Vilanova, Gabriela
Pandolfi, Daniel
San Pedro, María Eugenia de
Villagra, Andrea
Bain, María Elena
Gallard, Raúl Hector
Solving the flow shop scheduling problem under evolutionary approaches
topic_facet Ciencias Informáticas
Solving the flow shop scheduling problem
evolutionary approaches
Scheduling
ARTIFICIAL INTELLIGENCE
description The flow shop scheduling problem (FSSP) [12], has held the attention of many researchers. In a simplest usual situation, a set of jobs must follow the same route to be executed on a set of machines (resources) and the main objective is to optimize some performance variable (makespan, tardiness, lateness, etc.). In the case of the makespan, it have been proved that when the number of machines is greater than or equal to three, the problem is NP-hard.
format Objeto de conferencia
Objeto de conferencia
author Vilanova, Gabriela
Pandolfi, Daniel
San Pedro, María Eugenia de
Villagra, Andrea
Bain, María Elena
Gallard, Raúl Hector
author_facet Vilanova, Gabriela
Pandolfi, Daniel
San Pedro, María Eugenia de
Villagra, Andrea
Bain, María Elena
Gallard, Raúl Hector
author_sort Vilanova, Gabriela
title Solving the flow shop scheduling problem under evolutionary approaches
title_short Solving the flow shop scheduling problem under evolutionary approaches
title_full Solving the flow shop scheduling problem under evolutionary approaches
title_fullStr Solving the flow shop scheduling problem under evolutionary approaches
title_full_unstemmed Solving the flow shop scheduling problem under evolutionary approaches
title_sort solving the flow shop scheduling problem under evolutionary approaches
publishDate 2001
url http://sedici.unlp.edu.ar/handle/10915/21670
work_keys_str_mv AT vilanovagabriela solvingtheflowshopschedulingproblemunderevolutionaryapproaches
AT pandolfidaniel solvingtheflowshopschedulingproblemunderevolutionaryapproaches
AT sanpedromariaeugeniade solvingtheflowshopschedulingproblemunderevolutionaryapproaches
AT villagraandrea solvingtheflowshopschedulingproblemunderevolutionaryapproaches
AT bainmariaelena solvingtheflowshopschedulingproblemunderevolutionaryapproaches
AT gallardraulhector solvingtheflowshopschedulingproblemunderevolutionaryapproaches
bdutipo_str Repositorios
_version_ 1764820464792764418

Ejemplares similares