A New Job Priority Rule for the NEH-based heuristic to Minimize Makespan in Permutation Flowshops

Please use this identifier to cite or link to this item: https://doi.org/10.1080/0305215X.2022.2085259

DC Field	Value
dc.title	A New Job Priority Rule for the NEH-based heuristic to Minimize Makespan in Permutation Flowshops
dc.contributor.author	Jiang-Hua Zhang
dc.contributor.author	Son Duy Dao
dc.contributor.author	Wei Zhang
dc.contributor.author	Mark Goh
dc.contributor.author	Guodong Yu
dc.contributor.author	Yan Jin
dc.contributor.author	Weibo Liu
dc.date.accessioned	2023-07-14T06:38:52Z
dc.date.available	2023-07-14T06:38:52Z
dc.date.issued	2023-01-09
dc.identifier.citation	Jiang-Hua Zhang, Son Duy Dao, Wei Zhang, Mark Goh, Guodong Yu, Yan Jin, Weibo Liu (2023-01-09). A New Job Priority Rule for the NEH-based heuristic to Minimize Makespan in Permutation Flowshops. Engineering Optimization 55 (8) : 1296-1315. ScholarBank@NUS Repository. https://doi.org/10.1080/0305215X.2022.2085259
dc.identifier.issn	0305-215X
dc.identifier.uri	https://scholarbank.nus.edu.sg/handle/10635/243084
dc.publisher	Taylor & Francis
dc.source	Taylor & Francis
dc.type	Article
dc.contributor.department	ANALYTICS AND OPERATIONS
dc.description.doi	10.1080/0305215X.2022.2085259
dc.description.sourcetitle	Engineering Optimization
dc.description.volume	55
dc.description.issue	8
dc.description.page	1296-1315
Appears in Collections:	Staff Publications Elements

File	Description	Size	Format	Access Settings	Version
10.10800305215X.2022.2085259.zip		1.14 MB	ZIP	OPEN	None	View/Download

Check