Industrial-size scheduling with ASP+CP

DOI10.1007/978-3-642-20895-9_33zbMATH Open1327.90066OpenAlexW1885448744MaRDI QIDQ3003268FDOQ3003268

Marcello Balduccini

Publication date: 26 May 2011

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20895-9_33

Recommendations

• Representing production scheduling with constraint answer set programming
• ASP modulo CSP: the clingcon system
• Train scheduling with hybrid ASP
• Representing constraint satisfaction problems in answer set programming
• Train scheduling with hybrid answer set programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Logic programming (68N17)

Cited In (6)

• The Design of the Sixth Answer Set Programming Competition
• Constraint answer set solver EZCSP and why integration schemas matter
• Title not available (Why is that?)
• Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
• Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
• Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes

Uses Software

• ezcsp

This page was built for publication: Industrial-size scheduling with ASP+CP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003268)