DocumentCode
3149238
Title
Contingency handling in industrial planning
Author
Secker, Judith A.
Author_Institution
Staffordshire Polytech., Stafford, UK
fYear
1989
fDate
10-12 Apr 1989
Firstpage
264
Lastpage
269
Abstract
The current generation of planning systems cannot cope with problems containing extensive disjunction. An approach is described in which multiple alternatives can be handled efficiently by using techniques which identify and eliminate nonviable routes between the start point and the goal. The method relies on a set of supplementary data structures linked to route-defining branch labels. The result is a limited number of acceptable plans from which practical choice can be made depending upon the extant conditions
Keywords
industrial computer control; management; manufacturing data processing; acceptable plans; contingency handling; disjunction; goal; industrial planning; multiple alternatives; nonviable routes; route-defining branch labels; start point; supplementary data structures; Data structures; Explosions; Labeling; Production; Resource management; Routing; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Applications of Machine Intelligence and Vision, 1989., International Workshop on
Conference_Location
Tokyo
Type
conf
DOI
10.1109/MIV.1989.40561
Filename
40561
Link To Document