DocumentCode
1940768
Title
A Systematic Numerical Reduction Algorithm for Scheduling Graphs Imitating Symbolic Reduction
Author
Nagy, E.K. ; Loványi, I.
Author_Institution
Dept. of Control Eng. & Inf. Technol., BUTE, Budapest
fYear
2008
fDate
27-29 Nov. 2008
Firstpage
113
Lastpage
117
Abstract
This article is about the Forfex algorithm, which speeds up the enumeration of all possible solutions of a scheduling graph problem modeled in a Resource-Action-Constraint model, imitating symbolic reduction, by eliminating unnecessary action sequences. The article introduces the theoretical background, the scope of the research, the Forfex algorithm and the results.
Keywords
computer aided production planning; graph theory; production control; scheduling; symbol manipulation; Forfex algorithm; computer-assisted production planning; graph scheduling; resource-action-constraint model; symbolic reduction; systematic numerical reduction algorithm; Buffer storage; Clustering algorithms; Control engineering; Dynamic scheduling; Information technology; Job shop scheduling; Processor scheduling; Production systems; Scheduling algorithm; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Cybernetics, 2008. ICCC 2008. IEEE International Conference on
Conference_Location
Stara Lesna
Print_ISBN
978-1-4244-2874-8
Electronic_ISBN
978-1-4244-2875-5
Type
conf
DOI
10.1109/ICCCYB.2008.4721389
Filename
4721389
Link To Document