Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/100685
DC FieldValueLanguage
dc.contributor.authorCoelho, Pedro-
dc.contributor.authorSilva, Cristovão-
dc.date.accessioned2022-07-08T11:28:40Z-
dc.date.available2022-07-08T11:28:40Z-
dc.date.issued2021-
dc.identifier.issn18770509pt
dc.identifier.urihttps://hdl.handle.net/10316/100685-
dc.description.abstractProduction scheduling is one of the most critical activities in manufacturing. Under the context of Industry 4.0 paradigm, shop scheduling becomes even more complex. Metaheuristics present the potential to solve these harder problems but demand substantial computational power. The use of high-performance parallel architectures, present in cloud computing and edge computing, may support the develop of better metaheuristics, enabling Industry 4.0 with solution techniques to deal with their scheduling complexity. This study provides an overview of parallel metaheuristics for shop scheduling in recent literature. We reviewed 28 papers and classified them, according to parallel architectures, shop configuration, metaheuristics and optimization criteria. The results support that parallel metaheuristic have potential to tackle Industry 4.0 scheduling problems. However, it is essential to extend the research to the cloud and edge computing, flexible shop configurations, dynamic problems with multi-resource, and multi-objective optimization. Future studies should consider the use of real-world data instances.pt
dc.language.isoengpt
dc.relationUID/EMS/00285/2020pt
dc.relationinfo:eu-repo/grantAgreement/FCT/POR_CENTRO/SFRH/BD/129714/2017/PT/General solution approaches for rich vehicle routing problempt
dc.rightsopenAccesspt
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/pt
dc.subjectIndustry 4.0pt
dc.subjectproduction schedulingpt
dc.subjectmetaheuristicspt
dc.subjectparallel processingpt
dc.titleParallel Metaheuristics for Shop Scheduling: enabling Industry 4.0pt
dc.typearticle-
degois.publication.firstPage778pt
degois.publication.lastPage786pt
degois.publication.titleProcedia Computer Sciencept
dc.peerreviewedyespt
dc.identifier.doi10.1016/j.procs.2021.01.328pt
degois.publication.volume180pt
dc.date.embargo2021-01-01*
uc.date.periodoEmbargo0pt
item.fulltextCom Texto completo-
item.grantfulltextopen-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.openairetypearticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.project.grantnoinfo:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UID/EMS/00285/2020/PT/Centre for Mechanical Engineering-
crisitem.project.grantnoinfo:eu-repo/grantAgreement/FCT/POR_CENTRO/SFRH/BD/129714/2017/PT/General solution approaches for rich vehicle routing problem-
crisitem.author.researchunitCEMMPRE - Centre for Mechanical Engineering, Materials and Processes-
crisitem.author.orcid0000-0002-3715-6012-
crisitem.author.orcid0000-0002-7693-9570-
Appears in Collections:I&D CEMMPRE - Artigos em Revistas Internacionais
Files in This Item:
File Description SizeFormat
1-s2.0-S1877050921003793-main.pdf852.58 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

12
checked on Sep 16, 2024

WEB OF SCIENCETM
Citations

9
checked on Sep 2, 2024

Page view(s)

136
checked on Sep 24, 2024

Download(s)

74
checked on Sep 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons