A Metaheuristic Compendium for Scheduling Problems

The flexible job shop scheduling problem (FJSSP) is a difficult and complex problem, proved to be NP-hard, in manufacturing environments, because it has to assign each operation to the appropriate machine besides sequencing operations on machines. Due to that complexity, metaheuristics became the be...

Descripción completa

Detalles Bibliográficos
Autores principales: Bermúdez, Carlos, Minetti, Gabriela F., Salto, Carolina
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2017
Materias:
Ciencias Informáticas
flexible job shop scheduling problem
algorithmic trends
Heuristic methods
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/63480
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-63480
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
flexible job shop scheduling problem
algorithmic trends
Heuristic methods
spellingShingle Ciencias Informáticas
flexible job shop scheduling problem
algorithmic trends
Heuristic methods
Bermúdez, Carlos
Minetti, Gabriela F.
Salto, Carolina
A Metaheuristic Compendium for Scheduling Problems
topic_facet Ciencias Informáticas
flexible job shop scheduling problem
algorithmic trends
Heuristic methods
description The flexible job shop scheduling problem (FJSSP) is a difficult and complex problem, proved to be NP-hard, in manufacturing environments, because it has to assign each operation to the appropriate machine besides sequencing operations on machines. Due to that complexity, metaheuristics became the best choice to solve in practice this kind of problem. Therefore, the aim of this paper is to offer a reliable compendium in order to cover a wide algorithmic spectrum of different techniques. Further, a study of their accuracy and computational effort is carried out in order to achieve a behavior comparison. This paper shows different algorithmic trends that can be observed through this analysis.
format Objeto de conferencia
Objeto de conferencia
author Bermúdez, Carlos
Minetti, Gabriela F.
Salto, Carolina
author_facet Bermúdez, Carlos
Minetti, Gabriela F.
Salto, Carolina
author_sort Bermúdez, Carlos
title A Metaheuristic Compendium for Scheduling Problems
title_short A Metaheuristic Compendium for Scheduling Problems
title_full A Metaheuristic Compendium for Scheduling Problems
title_fullStr A Metaheuristic Compendium for Scheduling Problems
title_full_unstemmed A Metaheuristic Compendium for Scheduling Problems
title_sort metaheuristic compendium for scheduling problems
publishDate 2017
url http://sedici.unlp.edu.ar/handle/10915/63480
work_keys_str_mv AT bermudezcarlos ametaheuristiccompendiumforschedulingproblems
AT minettigabrielaf ametaheuristiccompendiumforschedulingproblems
AT saltocarolina ametaheuristiccompendiumforschedulingproblems
AT bermudezcarlos metaheuristiccompendiumforschedulingproblems
AT minettigabrielaf metaheuristiccompendiumforschedulingproblems
AT saltocarolina metaheuristiccompendiumforschedulingproblems
bdutipo_str Repositorios
_version_ 1764820480835977218

Ejemplares similares