Constraint-Based Scheduling with Complex Setup Operations: An Iterative Two-Layer Approach
Abstract
In this paper, we consider scheduling problems involving resources that must perform complex setup operations between the tasks they realize. To deal with such problems, we introduce a simple yet efficient iterative two-layer decision process that alternates between the fast synthesis of high-level schedules based on a coarse-grain model of setup operations, and the production of detailed schedules based on a fine-grain model. Experiments realized on representative benchmarks of a multi-robot application show the efficiency of the approach.
Cite
Text
Pacheco et al. "Constraint-Based Scheduling with Complex Setup Operations: An Iterative Two-Layer Approach." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/161Markdown
[Pacheco et al. "Constraint-Based Scheduling with Complex Setup Operations: An Iterative Two-Layer Approach." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/pacheco2019ijcai-constraint/) doi:10.24963/IJCAI.2019/161BibTeX
@inproceedings{pacheco2019ijcai-constraint,
title = {{Constraint-Based Scheduling with Complex Setup Operations: An Iterative Two-Layer Approach}},
author = {Pacheco, Adriana and Pralet, Cédric and Roussel, Stéphanie},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2019},
pages = {1155-1161},
doi = {10.24963/IJCAI.2019/161},
url = {https://mlanthology.org/ijcai/2019/pacheco2019ijcai-constraint/}
}