Paper Info
Title
Greedy Heuristics For Automatic Synthesis Of Efficient Block-Structured Scheduling Processes From Declarative Specifications
Abstract
This paper introduces a new Greedy heuristic algorithm for the automatic synthesis of block-structured scheduling processes that satisfy a given set of declarative ordering constraints, as well as basic theoretical results that support the correctness of this algorithm. We propose two heuristics that can be used with this algorithm: hierarchical decomposition heuristic and critical path heuristic. We also present initial experimental results supporting the effectiveness and efficiency of our proposed algorithm and heuristics.
Year
DOI
Venue
2018
10.1007/978-3-319-92007-8_16
ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS, AIAI 2018
Keywords
Field
DocType
Greedy algorithm, Process model, Ordering constraints, Optimization
Heuristic,Scheduling (computing),Computer science,Correctness,Greedy algorithm,Theoretical computer science,Heuristics,Artificial intelligence,Critical path method,Machine learning
Conference
Volume
ISSN
Citations 
519
1868-4238
0
PageRank 
References 
Authors
0.34
4
4
Name
Order
Citations
PageRank
Amelia Badica15414.93
Costin Badica242370.31
Daniela Danciulescu332.43
Doina Logofatu41716.74