Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
From MaRDI portal
Publication:5038465
Recommendations
Cites work
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- A genetic algorithm for the flexible job-shop scheduling problem
- A prediction based iterative decomposition algorithm for scheduling large-scale job shops
- ASP-Core-2 input language format
- Abstract gringo
- Answer set programming
- Benchmarks for basic scheduling problems
- Decomposition methods for large job shops
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
- Industrial-size scheduling with ASP+CP
- Multi-shot ASP solving with clingo
- Performance of decomposition procedures for job shop scheduling problems with bottleneck machines
- Shift design with answer set programming
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
- Team-building with answer set programming in the Gioia-Tauro seaport
- The Complexity of Flowshop and Jobshop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Train scheduling with hybrid answer set programming
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
Cited in
(5)- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
- scientific article; zbMATH DE number 6261538 (Why is no real title available?)
- A multi-shot ASP encoding for the aircraft routing and maintenance planning problem
- Adaptive large-neighbourhood search for optimisation in answer-set programming
- Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes
This page was built for publication: Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038465)