Show simple item record

dc.contributor.authorLewis, F.L.en_US
dc.contributor.authorHorne, B.G.en_US
dc.contributor.authorAbdallah, C.T.en_US
dc.date.accessioned2006-03-10T07:23:31Z
dc.date.available2006-03-10T07:23:31Z
dc.date.issued1996-04-06T04:00:50Z
dc.identifier.urihttp://hdl.handle.net/1928/86
dc.descriptionTechnical Reporten_US
dc.description.abstractThis 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.extent293393 bytes
dc.format.extent1888 bytes
dc.format.extent26756 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.language.isoen_USen_US
dc.relation.ispartofseriesEECE-TR-96-002en_US
dc.subjectJob Shop problemen_US
dc.subjectFlow Lineen_US
dc.subjectComplexity Theoryen_US
dc.subjectPetri Neten_US
dc.titleOn the Computational Complexity of the Manufacturing Job Shop and Renetrant Flow Lineen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record