Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-01821067
Contributor : Hal Ifip <>
Submitted on : Friday, June 22, 2018 - 11:45:48 AM
Last modification on : Friday, June 22, 2018 - 12:00:44 PM
Long-term archiving on: : Monday, September 24, 2018 - 5:27:44 PM

File

467708_1_En_16_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Amelia Bădică, Costin Bădică, Daniela Dănciulescu, Doina Logofătu. Greedy Heuristics for Automatic Synthesis of Efficient Block-Structured Scheduling Processes from Declarative Specifications. 14th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI), May 2018, Rhodes, Greece. pp.183-195, ⟨10.1007/978-3-319-92007-8_16⟩. ⟨hal-01821067⟩

Share

Metrics

Record views

195

Files downloads

3