Representing Production Scheduling with Constraint Answer Set Programming

DOI10.1007/978-3-319-28697-6_23zbMath1342.90059OpenAlexW2465915394MaRDI QIDQ2806918

Melanie Frühstück, Gerhard Friedrich, Anna Ryabokon, Vera Mersheeva, 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

zbMATH Keywords

production schedulingconstraint programmingdeclarative programming

Mathematics Subject Classification ID

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

Related Items (1)

Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP

Cites Work

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

This page was built for publication: Representing Production Scheduling with Constraint Answer Set Programming