A GRASP meta-heuristic for the hybrid flowshop scheduling problem

This paper considers a hybrid flowshop scheduling problem (HFSP). Since this problem is NP-hard, most of literature has been centred on the analysis of meta-heuristics and hybridised procedures. However, intelligent manufacturing systems in actual industrial practices mostly prefer the use of simple...

Descripción completa

Detalles Bibliográficos
Autores: González, E., Montoya, J.
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2017
País:Colombia
Institución:Universidad de los Andes
Repositorio:Séneca: repositorio Uniandes
Idioma:inglés
OAI Identifier:oai:repositorio.uniandes.edu.co:1992/47007
Acceso en línea:http://hdl.handle.net/1992/47007
Access Level:acceso abierto
Palabra clave:Scheduling
Hybrid flowshop
GRASP
Dispatching rules
id CO_eb3f24c53982fcc77d7746e424e38a2d
oai_identifier_str oai:repositorio.uniandes.edu.co:1992/47007
network_acronym_str CO
network_name_str Colombia
repository_id_str
spelling A GRASP meta-heuristic for the hybrid flowshop scheduling problemGonzález, E.Montoya, J.SchedulingHybrid flowshopGRASPDispatching rulesThis paper considers a hybrid flowshop scheduling problem (HFSP). Since this problem is NP-hard, most of literature has been centred on the analysis of meta-heuristics and hybridised procedures. However, intelligent manufacturing systems in actual industrial practices mostly prefer the use of simple algorithms. The greedy randomised adaptive search procedure (GRASP) is among the simplest approximation algorithms providing good results when solving hard combinatorial optimisation problems that currently exist in literature. The objective is to propose a GRASP to solve the classical HFSP under the optimisation of different objectives. The goal is not to solve a multi-objective problem, instead to design a solution procedure that performs well under various optimisation criteria. This performance is analysed through a set of computational experiments using well-known data-sets from the literature. The proposed GRASP obtains satisfactory results in comparison with traditional dispatching rules and can be easily implemented for efficient decision-making in real industrial practice.Facultad de Administración2020-10-01T16:51:03Z2020-10-01T16:51:03Z2017Artículo de revistainfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/version/c_ab4af688f83e57aaTexthttp://purl.org/redcol/resource_type/ARTp. 294-306 application/pdfhttp://hdl.handle.net/1992/4700710.1080/12460125.2017.1351863instname:Universidad de los Andesreponame:Repositorio Institucional Sénecarepourl:https://repositorio.uniandes.edu.co/reponame:Séneca: repositorio Uniandesinstname:Universidad de los Andesinstacron:Universidad de los AndesengAl consultar y hacer uso de este recurso, está aceptando las condiciones de uso establecidas por los autores.info:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf22022-06-02T14:03:50Z
dc.title.none.fl_str_mv A GRASP meta-heuristic for the hybrid flowshop scheduling problem
title A GRASP meta-heuristic for the hybrid flowshop scheduling problem
spellingShingle A GRASP meta-heuristic for the hybrid flowshop scheduling problem
González, E.
Scheduling
Hybrid flowshop
GRASP
Dispatching rules
title_short A GRASP meta-heuristic for the hybrid flowshop scheduling problem
title_full A GRASP meta-heuristic for the hybrid flowshop scheduling problem
title_fullStr A GRASP meta-heuristic for the hybrid flowshop scheduling problem
title_full_unstemmed A GRASP meta-heuristic for the hybrid flowshop scheduling problem
title_sort A GRASP meta-heuristic for the hybrid flowshop scheduling problem
dc.creator.none.fl_str_mv González, E.
Montoya, J.
author González, E.
author_facet González, E.
Montoya, J.
author_role author
author2 Montoya, J.
author2_role author
dc.subject.none.fl_str_mv Scheduling
Hybrid flowshop
GRASP
Dispatching rules
topic Scheduling
Hybrid flowshop
GRASP
Dispatching rules
description This paper considers a hybrid flowshop scheduling problem (HFSP). Since this problem is NP-hard, most of literature has been centred on the analysis of meta-heuristics and hybridised procedures. However, intelligent manufacturing systems in actual industrial practices mostly prefer the use of simple algorithms. The greedy randomised adaptive search procedure (GRASP) is among the simplest approximation algorithms providing good results when solving hard combinatorial optimisation problems that currently exist in literature. The objective is to propose a GRASP to solve the classical HFSP under the optimisation of different objectives. The goal is not to solve a multi-objective problem, instead to design a solution procedure that performs well under various optimisation criteria. This performance is analysed through a set of computational experiments using well-known data-sets from the literature. The proposed GRASP obtains satisfactory results in comparison with traditional dispatching rules and can be easily implemented for efficient decision-making in real industrial practice.
publishDate 2017
dc.date.none.fl_str_mv 2017
2020-10-01T16:51:03Z
2020-10-01T16:51:03Z
dc.type.none.fl_str_mv Artículo de revista
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
http://purl.org/coar/version/c_ab4af688f83e57aa
Text
http://purl.org/redcol/resource_type/ART
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/1992/47007
10.1080/12460125.2017.1351863
instname:Universidad de los Andes
reponame:Repositorio Institucional Séneca
repourl:https://repositorio.uniandes.edu.co/
url http://hdl.handle.net/1992/47007
identifier_str_mv 10.1080/12460125.2017.1351863
instname:Universidad de los Andes
reponame:Repositorio Institucional Séneca
repourl:https://repositorio.uniandes.edu.co/
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
rights_invalid_str_mv http://purl.org/coar/access_right/c_abf2
dc.format.none.fl_str_mv p. 294-306 
application/pdf
dc.publisher.none.fl_str_mv Facultad de Administración
publisher.none.fl_str_mv Facultad de Administración
dc.source.none.fl_str_mv reponame:Séneca: repositorio Uniandes
instname:Universidad de los Andes
instacron:Universidad de los Andes
instname_str Universidad de los Andes
instacron_str Universidad de los Andes
institution Universidad de los Andes
reponame_str Séneca: repositorio Uniandes
collection Séneca: repositorio Uniandes
_version_ 1825050602063790080
score 15,812455

Similares en LA Referencia