论文信息 - On The Computational Complexity Of The Manufacturing Job Shop And Reentrant Flow Line

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

This paper presents a comparison study of the computational complexity of the general job shop protocol and the ow line protocol in a exible manufacturing system. It is shown that a certain representative problem of nding resource invariants is NP-complete in the case of the job shop, while in the ow line case it admits a closed-form solution. The importance of correctly selecting part ow and job routing protocols in exible manufacturing systems to reduce complexity is thereby conclusively demonstrated.

[1] D. V. Steward. On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations , 1962 .

[2] W. M. Wonham,et al. The control of discrete event systems , 1989 .

[3] MuDer Jeng,et al. Synthesis using resource control nets for modeling shared-resource systems , 1995, IEEE Trans. Robotics Autom..

[4] MengChu Zhou,et al. A hybrid methodology for synthesis of Petri net models for manufacturing systems , 1992, IEEE Trans. Robotics Autom..

[5] Javier Martínez,et al. A Petri net based deadlock prevention policy for flexible manufacturing systems , 1995, IEEE Trans. Robotics Autom..

[6] Bruce H. Krogh,et al. Synthesis of feedback control logic for discrete manufacturing systems , 1991, Autom..

[7] P. R. Kumar,et al. Distributed scheduling based on due dates and buffer priorities , 1991 .