DocumentCode
274687
Title
Feasibility problem of a class of discrete manufacturing process and its solution
Author
Wang, L. ; Xu, X.
Author_Institution
Northeast Univ. of Technol., China
fYear
1991
fDate
25-28 Mar 1991
Firstpage
887
Abstract
Proposes the feasibility problem of a class of deterministic discrete manufacturing system, explores the operation behavior of such process on the basis of the concepts of partial order set, event graph, sequence matrix, and one-step-backward sequence matrix, develops an algorithm for finding out an optimum prone compatible row sequence matrix, and proves the tenability of the argument, and as such one solution to the problem is obtained
Keywords
discrete time systems; graph theory; manufacturing processes; matrix algebra; scheduling; deterministic discrete manufacturing system; discrete event systems; event graph; manufacturing process; partial order set; sequence matrix;
fLanguage
English
Publisher
iet
Conference_Titel
Control 1991. Control '91., International Conference on
Conference_Location
Edinburgh
Print_ISBN
0-85296-509-5
Type
conf
Filename
98567
Link To Document