An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time

dc.contributor.author	Gao, K.Z.
dc.contributor.author	Suganthan, P.N.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Tasgetiren, M.F.
dc.date.accessioned	2021-01-25T20:49:51Z
dc.date.available	2021-01-25T20:49:51Z
dc.date.issued	2015
dc.identifier	10.1080/00207543.2015.1020174
dc.identifier.issn	00207543
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938966156&doi=10.1080%2f00207543.2015.1020174&partnerID=40&md5=8b24eda1f04e617d53e45dd26180414c
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10338
dc.description.abstract	This study addresses flexible job shop scheduling problem (FJSP) with fuzzy processing time. The fuzzy or uncertainty of processing time is one of seven characteristics in remanufacturing. A discrete harmony search (DHS) algorithm is proposed for FJSP wit
dc.language.iso	English
dc.publisher	International Journal of Production Research
dc.title	An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time
dc.type	Article
dc.relation.firstpage	5896
dc.relation.lastpage	5911
dc.relation.volume	53
dc.relation.issue	19
dc.description.affiliations	School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore; School of Computer, Liaocheng University, Liaocheng, China; Department of Industrial Engineering, Yasar University, Izmir, Turkey

Files in this item

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