A Metaheuristic Compendium for Scheduling Problems
- Autores
- Bermúdez, Carlos; Minetti, Gabriela F.; Salto, Carolina
- Año de publicación
- 2017
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- 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.
Eje: XVIII Workshop de Agentes y Sistemas Inteligentes (WASI).
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
flexible job shop scheduling problem
algorithmic trends
Heuristic methods - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/4.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/63480
Ver los metadatos del registro completo
| id |
SEDICI_a9eb3f9a91351f88798cc0c84cdc5afc |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/63480 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
A Metaheuristic Compendium for Scheduling ProblemsBermúdez, CarlosMinetti, Gabriela F.Salto, CarolinaCiencias Informáticasflexible job shop scheduling problemalgorithmic trendsHeuristic methodsThe 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.Eje: XVIII Workshop de Agentes y Sistemas Inteligentes (WASI).Red de Universidades con Carreras en Informática (RedUNCI)2017-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf2-12http://sedici.unlp.edu.ar/handle/10915/63480enginfo:eu-repo/semantics/altIdentifier/isbn/978-950-34-1539-9info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-10T12:11:40Zoai:sedici.unlp.edu.ar:10915/63480Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-10 12:11:40.469SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
A Metaheuristic Compendium for Scheduling Problems |
| title |
A Metaheuristic Compendium for Scheduling Problems |
| spellingShingle |
A Metaheuristic Compendium for Scheduling Problems Bermúdez, Carlos Ciencias Informáticas flexible job shop scheduling problem algorithmic trends Heuristic methods |
| 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 |
A Metaheuristic Compendium for Scheduling Problems |
| dc.creator.none.fl_str_mv |
Bermúdez, Carlos Minetti, Gabriela F. Salto, Carolina |
| author |
Bermúdez, Carlos |
| author_facet |
Bermúdez, Carlos Minetti, Gabriela F. Salto, Carolina |
| author_role |
author |
| author2 |
Minetti, Gabriela F. Salto, Carolina |
| author2_role |
author author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas flexible job shop scheduling problem algorithmic trends Heuristic methods |
| topic |
Ciencias Informáticas flexible job shop scheduling problem algorithmic trends Heuristic methods |
| dc.description.none.fl_txt_mv |
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. Eje: XVIII Workshop de Agentes y Sistemas Inteligentes (WASI). Red de Universidades con Carreras en Informática (RedUNCI) |
| 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. |
| publishDate |
2017 |
| dc.date.none.fl_str_mv |
2017-10 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
| format |
conferenceObject |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/63480 |
| url |
http://sedici.unlp.edu.ar/handle/10915/63480 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/isbn/978-950-34-1539-9 |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| dc.format.none.fl_str_mv |
application/pdf 2-12 |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1842904032275857408 |
| score |
12.993085 |