DocumentCode
1157469
Title
Optimisation of invariant criteria for event graphs
Author
Laftit, Said ; Proth, Jean-marie ; Xie, Xiao-Lan
Author_Institution
INRIA-Lorraine, Metz, France
Volume
37
Issue
5
fYear
1992
fDate
5/1/1992 12:00:00 AM
Firstpage
547
Lastpage
555
Abstract
The problem of obtaining a cycle time that is smaller than a given value in a strongly connected event graph, while minimizing an invariant linear criterion, is addressed. This linear criterion is based on a p -invariant of the strongly connected event graph under consideration. Some properties of the optimal solution are proved, and a heuristic algorithm and an exact algorithm which make it possible to reach a solution to the problem are given. Applications of the results to the evaluation of job shops and Kanban systems are proposed
Keywords
graph theory; operations research; optimisation; Kanban systems; cycle time; exact algorithm; heuristic algorithm; invariant criteria; job shops; linear criterion; optimisation; p-invariant; strongly connected event graph; Assembly systems; Circuits; Discrete event systems; Heuristic algorithms; Manufacturing systems; Mechanical engineering; Petri nets; System recovery; Virtual manufacturing;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/9.135488
Filename
135488
Link To Document