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-25T20:50:29Z
dc.date.available	2021-01-25T20:50:29Z
dc.date.issued	2013
dc.identifier	10.1007/978-3-319-03753-0_3
dc.identifier.issn	03029743
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84893309773&doi=10.1007%2f978-3-319-03753-0_3&partnerID=40&md5=2f97206c9613d611847dbfa726faa69b
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10472
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	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.title	A general variable neighborhood search algorithm for the no-idle permutation flowshop scheduling problem
dc.type	Conference Paper
dc.relation.firstpage	24
dc.relation.lastpage	34
dc.relation.volume	8297 LNCS
dc.relation.issue	PART 1
dc.description.affiliations	Industrial Engineering Department, Yasar University, Izmir, Turkey; College of Computer Science, Liaocheng University, Liaocheng, Shandong, China; School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore

Files in this item

Files	Size	Format	View
There are no files associated with this item.