LoboVault Home
 

On the Computational Complexity of the Manufacturing Job Shop and Renetrant Flow Line

LoboVault

Please use this identifier to cite or link to this item: http://hdl.handle.net/1928/86

On the Computational Complexity of the Manufacturing Job Shop and Renetrant Flow Line

Show simple item record

dc.contributor.author Lewis, F.L. en_US
dc.contributor.author Horne, B.G. en_US
dc.contributor.author Abdallah, C.T. en_US
dc.date.accessioned 2006-03-10T07:23:31Z
dc.date.available 2006-03-10T07:23:31Z
dc.date.issued 1996-04-06T04:00:50Z
dc.identifier.uri http://hdl.handle.net/1928/86
dc.description Technical Report en_US
dc.description.abstract This paper presents a comparison study of the computational complexity of the general job shop protocol and the flow line protocol in a flexible manufacturing system. It is shown that a certain representative problem of finding resource invariants is NP-complete in the case of the job shop, while in the flow line case it admits a closed-form solution. The importance of correctly selecting part flow and job routing protocols in flexible manufacturing systems to reduce complexity is thereby conclusively demonstrated. en_US
dc.format.extent 293393 bytes
dc.format.extent 1888 bytes
dc.format.extent 26756 bytes
dc.format.mimetype application/pdf
dc.format.mimetype text/plain
dc.format.mimetype text/plain
dc.language.iso en_US en_US
dc.relation.ispartofseries EECE-TR-96-002 en_US
dc.subject Job Shop problem en_US
dc.subject Flow Line en_US
dc.subject Complexity Theory en_US
dc.subject Petri Net en_US
dc.title On the Computational Complexity of the Manufacturing Job Shop and Renetrant Flow Line en_US
dc.type Technical Report en_US


Files in this item

Files Size Format View
TR_EECE96_002.pdf 286.5Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

UNM Libraries

Search LoboVault


Advanced Search

Browse

My Account