A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem

dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Buyukdagli, O.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Suganthan, P.N.
dc.date.accessioned	2021-01-25T19:35:34Z
dc.date.available	2021-01-25T19:35:34Z
dc.date.issued	2013
dc.identifier.issn	0302-9743
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/8177
dc.description.abstract	In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner loop operates a variable neighbo
dc.language.iso	English
dc.publisher	SPRINGER-VERLAG BERLIN
dc.title	A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem
dc.type	Proceedings Paper
dc.relation.firstpage	24
dc.relation.lastpage	+
dc.relation.volume	8297
dc.description.woscategory	Computer Science, Artificial Intelligence; Computer Science, Theory & Methods
dc.description.wosresearcharea	Computer Science
dc.identifier.wosid	WOS:000350034300003
dc.identifier.ctitle	4th International Conference on Swarm, Evolutionary, and Memetic Computing (SEMCCO)
dc.identifier.cdate	DEC 19-21, 2013

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.