SOLVING MULTIOBJECTIVE FLOWSHOP SCHEDULING PROBLEM BY GRASP WITH PATH-RELINKING

dc.contributor.author	Iryna Yevseyva	en
dc.contributor.author	Jorge Pinho de Sousa	en
dc.contributor.author	Ana Viana	en
dc.date.accessioned	2017-11-16T13:08:14Z
dc.date.available	2017-11-16T13:08:14Z
dc.date.issued	2011	en
dc.description.abstract	In this work, a hybrid metaheuristic for solving the bi-objective flowshop problem with makespan and tardiness objectives is proposed. It is based on the well-known greedy randomized adaptive search procedure (GRASP) with path-relinking adapted to the multiobjective case. The proposed approach is tested on several flowshop instances and compared to existing results from literature with the hypervolume performance measures.	en
dc.identifier.uri	http://repositorio.inesctec.pt/handle/123456789/2037
dc.language	eng	en
dc.relation	1201	en
dc.relation	3708	en
dc.rights	info:eu-repo/semantics/embargoedAccess	en
dc.title	SOLVING MULTIOBJECTIVE FLOWSHOP SCHEDULING PROBLEM BY GRASP WITH PATH-RELINKING	en
dc.type	conferenceObject	en
dc.type	Publication	en