An energy-efficient permutation 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.contributor.author	Kandiller, L.
dc.date.accessioned	2021-01-25T19:32:35Z
dc.date.available	2021-01-25T19:32:35Z
dc.date.issued	2020
dc.identifier	10.1016/j.eswa.2020.113279
dc.identifier.issn	0957-4174
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/7262
dc.description.abstract	The permutation flowshop scheduling problem (PFSP) has been extensively explored in scheduling literature because it has many real-world industrial implementations. In some studies, multiple objectives related to production efficiency have been considered
dc.description.sponsorship	Huazhong University of Science and Technology (HUST) Project in Wuhan, China; 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	An energy-efficient permutation flowshop scheduling problem
dc.type	Article
dc.relation.volume	150
dc.description.woscategory	Computer Science, Artificial Intelligence; Engineering, Electrical & Electronic; Operations Research & Management Science
dc.description.wosresearcharea	Computer Science; Engineering; Operations Research & Management Science
dc.identifier.wosid	WOS:000528193700007

Files in this item

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