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	Chua, T.J.
dc.date.accessioned	2021-01-25T19:36:07Z
dc.date.available	2021-01-25T19:36:07Z
dc.date.issued	2011
dc.identifier	10.1080/00207543.2010.497781
dc.identifier.issn	0020-7543
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/8270
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.description.sponsorship	A*Star (Agency for Science, Technology and Research)Agency for Science Technology & Research (ASTAR) [052 101 0020]; National Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [60874075, 70871065]; Open Research Foundation fro
dc.language.iso	English
dc.publisher	TAYLOR & FRANCIS LTD
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.woscategory	Engineering, Industrial; Engineering, Manufacturing; Operations Research & Management Science
dc.description.wosresearcharea	Engineering; Operations Research & Management Science
dc.identifier.wosid	WOS:000299879800015

Files in this item

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