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 full item record

Title: On the Computational Complexity of the Manufacturing Job Shop and Renetrant Flow Line
Author: Lewis, F.L.; Horne, B.G.; Abdallah, C.T.
Subject(s): Job Shop problem
Flow Line
Complexity Theory
Petri Net
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.
Date: 1996-04-06
Series: EECE-TR-96-002
Description: Technical Report
URI: http://hdl.handle.net/1928/86

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 full item record

UNM Libraries

Search LoboVault


Advanced Search

Browse

My Account