Minimizing the maximum flow time for flexible job shop problem with parallel machines

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

DC Field	Value
dc.title	Minimizing the maximum flow time for flexible job shop problem with parallel machines
dc.contributor.author	Xiang, Nengjie
dc.contributor.author	LIU CHANGCHUN
dc.date.accessioned	2019-08-26T00:52:24Z
dc.date.available	2019-08-26T00:52:24Z
dc.date.issued	2019-08-14
dc.identifier.citation	Xiang, Nengjie, LIU CHANGCHUN (2019-08-14). Minimizing the maximum flow time for flexible job shop problem with parallel machines. Journal of Industrial and Production Engineering : 1-15. ScholarBank@NUS Repository. https://doi.org/10.1080/21681015.2019.1646508
dc.identifier.issn	2168-1015
dc.identifier.issn	2168-1023
dc.identifier.uri	https://scholarbank.nus.edu.sg/handle/10635/158046
dc.publisher	Informa UK Limited
dc.source	Elements
dc.type	Article
dc.date.updated	2019-08-23T09:27:46Z
dc.contributor.department	INST OF OPERATIONS RESEARCH & ANALYTICS
dc.description.doi	10.1080/21681015.2019.1646508
dc.description.sourcetitle	Journal of Industrial and Production Engineering
dc.description.page	1-15
dc.published.state	Published
Appears in Collections:	Staff Publications Elements

File	Description	Size	Format	Access Settings	Version
2-7 Minimizing the maximum flow time for flexible job shop problem with parallel machines.pdf		1.85 MB	Adobe PDF	CLOSED	Published

Check