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

10.1080/21681015.2019.1646508

Saved in:
Bibliographic Details
Main Authors: Xiang, Nengjie, LIU CHANGCHUN
Other Authors: INST OF OPERATIONS RESEARCH & ANALYTICS
Format: Article
Published: Informa UK Limited 2019
Online Access:https://scholarbank.nus.edu.sg/handle/10635/158046
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-158046
record_format dspace
spelling sg-nus-scholar.10635-1580462024-11-14T05:05:34Z Minimizing the maximum flow time for flexible job shop problem with parallel machines Xiang, Nengjie LIU CHANGCHUN INST OF OPERATIONS RESEARCH & ANALYTICS Mr Liu Changchun 10.1080/21681015.2019.1646508 Journal of Industrial and Production Engineering 1-15 2019-08-26T00:52:24Z 2019-08-26T00:52:24Z 2019-08-14 2019-08-23T09:27:46Z Article 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 2168-1015 2168-1023 https://scholarbank.nus.edu.sg/handle/10635/158046 Informa UK Limited Elements
institution National University of Singapore
building NUS Library
continent Asia
country Singapore
Singapore
content_provider NUS Library
collection ScholarBank@NUS
description 10.1080/21681015.2019.1646508
author2 INST OF OPERATIONS RESEARCH & ANALYTICS
author_facet INST OF OPERATIONS RESEARCH & ANALYTICS
Xiang, Nengjie
LIU CHANGCHUN
format Article
author Xiang, Nengjie
LIU CHANGCHUN
spellingShingle Xiang, Nengjie
LIU CHANGCHUN
Minimizing the maximum flow time for flexible job shop problem with parallel machines
author_sort Xiang, Nengjie
title Minimizing the maximum flow time for flexible job shop problem with parallel machines
title_short Minimizing the maximum flow time for flexible job shop problem with parallel machines
title_full Minimizing the maximum flow time for flexible job shop problem with parallel machines
title_fullStr Minimizing the maximum flow time for flexible job shop problem with parallel machines
title_full_unstemmed Minimizing the maximum flow time for flexible job shop problem with parallel machines
title_sort minimizing the maximum flow time for flexible job shop problem with parallel machines
publisher Informa UK Limited
publishDate 2019
url https://scholarbank.nus.edu.sg/handle/10635/158046
_version_ 1821194800064364544