Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling

DOI10.1017/S1471068422000217OpenAlexW4283797444MaRDI QIDQ5038465

Mohammed M. S. El-Kholany, Konstantin Schekotihin, Martin Gebser

Publication date: 30 September 2022

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.07537

zbMATH Keywords

answer set programmingproblem decompositionjob-shop scheduling problem

Mathematics Subject Classification ID

Logic programming (68N17)

Uses Software

• Gringo
• Clingo
• OR-tools
• teaspoon

Cites Work

• Unnamed Item
• Decomposition methods for large job shops
• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
• Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
• Benchmarks for basic scheduling problems
• A prediction based iterative decomposition algorithm for scheduling large-scale job shops
• A genetic algorithm for the flexible job-shop scheduling problem
• Team-building with answer set programming in the Gioia-Tauro seaport
• Industrial-Size Scheduling with ASP+CP
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• The Complexity of Flowshop and Jobshop Scheduling
• Performance of decomposition procedures for job shop scheduling problems with bottleneck machines
• Shift Design with Answer Set Programming*
• Abstract gringo
• ASP-Core-2 Input Language Format
• Train Scheduling with Hybrid Answer Set Programming
• Multi-shot ASP solving with clingo
• Answer Set Programming
• Fast and Flexible Difference Constraint Propagation for DPLL(T)

This page was built for publication: Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling