Metaheuristic algorithms for the hybrid flowshop scheduling problem

dc.contributor.author	Oztop, H.
dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Tursel Eliiyi, D.
dc.contributor.author	Pan, Q.K.
dc.date.accessioned	2021-01-25T19:32:44Z
dc.date.available	2021-01-25T19:32:44Z
dc.date.issued	2019
dc.identifier	10.1016/j.cor.2019.06.009
dc.identifier.issn	0305-0548
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/7374
dc.description.abstract	The hybrid flowshop scheduling problem (HFSP) has been widely studied in the literature, as it has many real-life applications in industry. Even though many solution approaches have been presented for the HFSP with makespan criterion, studies on HFSP with
dc.description.sponsorship	National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [51435009]
dc.language.iso	English
dc.publisher	PERGAMON-ELSEVIER SCIENCE LTD
dc.title	Metaheuristic algorithms for the hybrid flowshop scheduling problem
dc.type	Article
dc.relation.firstpage	177
dc.relation.lastpage	196
dc.relation.volume	111
dc.description.woscategory	Computer Science, Interdisciplinary Applications; Engineering, Industrial; Operations Research & Management Science
dc.description.wosresearcharea	Computer Science; Engineering; Operations Research & Management Science
dc.identifier.wosid	WOS:000483411600013

Files in this item

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