A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion

dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Suganthan, P.N.
dc.contributor.author	Jin Chua, T.
dc.date.accessioned	2021-01-25T20:51:16Z
dc.date.available	2021-01-25T20:51:16Z
dc.date.issued	2011
dc.identifier	10.1080/00207543.2010.497781
dc.identifier.issn	00207543
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-79960512575&doi=10.1080%2f00207543.2010.497781&partnerID=40&md5=36865ee50ccb02e81d25ccb9516ed20d
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10616
dc.description.abstract	In this paper, we investigate the use of a continuous algorithm for the no-idle permutation flowshop scheduling (NIPFS) problem with tardiness criterion. For this purpose, a differential evolution algorithm with variable parameter search (vpsDE) is develo
dc.language.iso	English
dc.publisher	International Journal of Production Research
dc.title	A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
dc.type	Article
dc.relation.firstpage	5033
dc.relation.lastpage	5050
dc.relation.volume	49
dc.relation.issue	16
dc.description.affiliations	Department of Industrial Engineering, Yasar University, Selcuk Yasar Campus, Izmir, Turkey; College of Computer Science, Liaocheng University, Liaocheng, Shandong Province, 252059, China; School of Electrical and Electronic Engineering, Nanyang Technologi

Files in this item

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