Greedy Heuristics for Automatic Synthesis of Efficient Block-Structured Scheduling Processes from Declarative Specifications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Greedy Heuristics for Automatic Synthesis of Efficient Block-Structured Scheduling Processes from Declarative Specifications

Amelia Bădică
  • Function : Author
  • PersonId : 1033524
Costin Bădică
  • Function : Author
  • PersonId : 1007994
Doina Logofătu
  • Function : Author
  • PersonId : 1033502

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.
Fichier principal
Vignette du fichier
467708_1_En_16_Chapter.pdf (191.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01821067 , version 1 (22-06-2018)

Licence

Attribution

Identifiers

Cite

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⟩
59 View
39 Download

Altmetric

Share

Gmail Facebook X LinkedIn More