On sequencing problems of repetitive production systems

Author

Puquan, Xu ; Changyou, Liu ; Xinhe, Xu

Author_Institution

Dept. of Autom. Control, Northeast Univ. of Technol., Shenyang, China

Volume

38

Issue

7

fYear

1993

fDate

7/1/1993 12:00:00 AM

Firstpage

1124

Lastpage

1128

Abstract

The two-machine sequencing problem for a repetitive production system that is viewed as a deterministic discrete-event dynamic system is considered. The objective is to minimize the steady period, which is also the average weight of the critical circuit of the timed marked graph describing the system. The classification of the sequencing problems is done according to the ordering ranks of the ordering matrices. The two-machine sequencing problem is completely solved. The discussion is based on the theories of time-marked graphs and max algebra

Keywords

discrete time systems; graph theory; matrix algebra; optimisation; production control; deterministic discrete-event dynamic system; graph theory; max algebra; optimisation; ordering matrices; production control; repetitive production systems; scheduling; timed marked graph; two-machine sequencing problem; Automatic control; Control systems; Control theory; Ear; Nonlinear control systems; Polynomials; Production systems; Publishing; Robots; State-space methods;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.231469

Filename

231469