A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion

dc.contributor.author	Kizilay, D.
dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Pan, Q.K.
dc.contributor.author	Gao, L.
dc.date.accessioned	2021-01-25T19:32:48Z
dc.date.available	2021-01-25T19:32:48Z
dc.date.issued	2019
dc.identifier	10.3390/a12050100
dc.identifier.issn	1999-4893
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/7418
dc.description.abstract	In this paper, we propose a variable block insertion heuristic (VBIH) algorithm to solve the permutation flow shop scheduling problem (PFSP). The VBIH algorithm removes a block of jobs from the current solution. It applies an insertion local search to the
dc.description.sponsorship	National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [51435009]
dc.language.iso	English
dc.publisher	MDPI
dc.title	A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion
dc.type	Article
dc.relation.volume	12
dc.relation.issue	5
dc.description.woscategory	Computer Science, Artificial Intelligence; Computer Science, Theory & Methods
dc.description.wosresearcharea	Computer Science
dc.identifier.wosid	WOS:000470960200013

Files in this item

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