Representing production scheduling with constraint answer set programming

DOI10.1007/978-3-319-28697-6_23zbMATH Open1342.90059OpenAlexW2465915394MaRDI QIDQ2806918FDOQ2806918

Authors: Gerhard Friedrich, Melanie Frühstück, Vera Mersheeva, Anna Ryabokon, Maria Sander, Andreas Starzacher, Erich Christian Teppan 

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_23

Recommendations

• Industrial-size scheduling with ASP+CP
• Representing constraint satisfaction problems in answer set programming
• scientific article; zbMATH DE number 1045434
• Constraint answer set programming systems
• Train scheduling with hybrid answer set programming

zbMATH Keywords

constraint programmingdeclarative programmingproduction scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Cites Work

• Extending and implementing the stable model semantics
• Relating constraint answer set programming languages and algorithms

Cited In (2)

• Industrial-size scheduling with ASP+CP
• Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP

This page was built for publication: Representing production scheduling with constraint answer set programming

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