A Biased Random Key Genetic Algorithm for the Flexible Job Shop Problem with Transportation

S. Mahdi Homayouni; Dalila M. M. Fontes; Fernando A. C. C. Fontes

Please use this identifier to cite or link to this item: https://hdl.handle.net/10216/130539

Full metadata record

DC Field	Value	Language
dc.creator	S. Mahdi Homayouni
dc.creator	Dalila M. M. Fontes
dc.creator	Fernando A. C. C. Fontes
dc.date.accessioned	2024-01-09T00:16:58Z	-
dc.date.available	2024-01-09T00:16:58Z	-
dc.date.issued	2019
dc.identifier.other	sigarra:432016
dc.identifier.uri	https://hdl.handle.net/10216/130539	-
dc.description.abstract	This work addresses the Flexible Job Shop Scheduling Problem with Transportation resources (FJSPT), which can be seen as an extension of both the Flexible Job Shop Scheduling Problem (FJS) and the Job Shop Scheduling Problem with Transportation resources (JSPT). Regarding the former case, the FJSPT additionally considers that the jobs need to be transported to the machines they are processed in; while regarding the latter, in the FJSP the specific machine processing each operation also needs to decided. The FJSPT is NP-hard since, it extends NP-hard problems. In here, we propose an operation based biased random key genetic algorithm to efficiently find good quality solutions.
dc.language.iso	eng
dc.relation.ispartof	XIII Metaheuristics International Conference MIC
dc.rights	restrictedAccess
dc.title	A Biased Random Key Genetic Algorithm for the Flexible Job Shop Problem with Transportation
dc.type	Artigo em Livro de Atas de Conferência Internacional
dc.contributor.uporto	Faculdade de Engenharia
dc.contributor.uporto	Faculdade de Economia
Appears in Collections:	FEP - Artigo em Livro de Atas de Conferência Internacional FEUP - Artigo em Livro de Atas de Conferência Internacional

Files in This Item:

File	Description	Size	Format
432016.pdf Restricted Access		254.59 kB	Adobe PDF	Request a copy from the Author(s)

Show simple item record Recommend this item Display Statistics