LoboVault Home
 

On The Computational Complexity Of The Manufacturing Job Shop And Reentrant Flow Line

LoboVault

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

On The Computational Complexity Of The Manufacturing Job Shop And Reentrant Flow Line

Show full item record

Title: On The Computational Complexity Of The Manufacturing Job Shop And Reentrant Flow Line
Author: Abdallah, Chaouki T.; Lewis, F.L.; Horne, B.G.
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. 1 Introduction In a general flexible manufacturing system (FMS) where resources are shared, a key role in part routing, job selection, and resource assignment is played by the FMS controller. Given the same resources of machines, robots, fixtures, tooling, and so on, different structures result under different routing/assignment strategies by the controller. Unstructured strategies are generally classified as the so-called job shop organization, while structured protocols ...
Date: 2012-04-13
URI: http://hdl.handle.net/1928/20371

Files in this item

Files Size Format View
Abdallah Lewis ... nd Reentrant Flow Line.pdf 997.2Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record

UNM Libraries

Search LoboVault


Advanced Search

Browse

My Account