Constraint Logic Programming for Real-World Test Laboratory Scheduling
Uloženo v:
| Název: | Constraint Logic Programming for Real-World Test Laboratory Scheduling |
|---|---|
| Autoři: | Tobias Geibinger, Florian Mischek, Nysret Musliu |
| Zdroj: | Proceedings of the AAAI Conference on Artificial Intelligence. 35:6358-6366 |
| Informace o vydavateli: | Association for the Advancement of Artificial Intelligence (AAAI), 2021. |
| Rok vydání: | 2021 |
| Témata: | 0211 other engineering and technologies, 02 engineering and technology |
| Popis: | The Test Laboratory Scheduling Problem (TLSP) and its subproblem TLSP-S are real-world industrial scheduling problems that are extensions of the Resource-Constrained Project Scheduling Problem (RCPSP). Besides several additional constraints, TLSP includes a grouping phase where the jobs to be scheduled have to be assembled from smaller tasks and derive their properties from this grouping. For TLSP-S such a grouping is already part of the input. In this work, we show how TLSP-S can be solved by Answer-set Programming extended with ideas from other constraint solving paradigms. We propose a novel and efficient encoding and apply an answer-set solver for constraint logic programs called clingcon. Additionally, we utilize our encoding in a Very Large Neighborhood Search framework and compare our methods with the state of the art approaches. Our approach provides new upper bounds and optimality proofs for several existing benchmark instances in the literature. |
| Druh dokumentu: | Article |
| ISSN: | 2374-3468 2159-5399 |
| DOI: | 10.1609/aaai.v35i7.16789 |
| Přístupové číslo: | edsair.doi...........2893a5a9d49c40f4fe630470ab72012f |
| Databáze: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | The Test Laboratory Scheduling Problem (TLSP) and its subproblem TLSP-S are real-world industrial scheduling problems that are extensions of the Resource-Constrained Project Scheduling Problem (RCPSP). Besides several additional constraints, TLSP includes a grouping phase where the jobs to be scheduled have to be assembled from smaller tasks and derive their properties from this grouping. For TLSP-S such a grouping is already part of the input. In this work, we show how TLSP-S can be solved by Answer-set Programming extended with ideas from other constraint solving paradigms. We propose a novel and efficient encoding and apply an answer-set solver for constraint logic programs called clingcon. Additionally, we utilize our encoding in a Very Large Neighborhood Search framework and compare our methods with the state of the art approaches. Our approach provides new upper bounds and optimality proofs for several existing benchmark instances in the literature. |
|---|---|
| ISSN: | 23743468 21595399 |
| DOI: | 10.1609/aaai.v35i7.16789 |