Skip to main content
SpringerLink
Log in

Representing Production Scheduling with Constraint Answer Set Programming

  • Conference paper
  • First Online:
Operations Research Proceedings 2014

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

Answer Set Programming and Constraint Programming constitute declarative programming approaches with different strengths which have already been shown to be highly effective for many hard combinatorial problems. In this article we discuss two hybrid Constraint Answer Set Programming approaches with regard to their suitability for encoding production scheduling problems. Our exemplifications are done on the basis of a production scheduling problem of Infineon Technologies Austria AG.

The authors are funded by FFG (grant 840242) and listed in alphabetical order.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    clingcon, clasp and gringo are available on http://sf.net/projects/potassco/files/.

  2. 2.

    http://www.mbal.tk/ezcsp/index.html.

  3. 3.

    In our paper only parts of the models are provided due to the space limit. The full encodings as well as input and output formats can be found at http://isbi.aau.at/hint/problems.

  4. 4.

    The experiments were performed on a system with Intel i7-3930K CPU (3.20 GHz), 64 GB of RAM, running Ubuntu.

  5. 5.

    Instances are available at http://isbi.aau.at/hint/images/lsp/benchmarks.zip.

References

  1. Balduccini, M.: Representing constraint satisfaction problems in answer set programming. In: ASPOCP (2009)

    Google Scholar 

  2. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP/SLP, pp. 1070–1080 (1988)

    Google Scholar 

  3. Lierler, Y.: Relating constraint answer set programming languages and algorithms. Artif. Intell. 207, 1–22 (2014)

    Article  Google Scholar 

  4. Ostrowski, M., Schaub, T.: ASP modulo CSP: the clingcon system. TPLP 12(4–5), 485–503 (2012)

    Google Scholar 

  5. Shaw, M.J.P. Whinston, A.B.: Automatic planning and flexible scheduling: a knowledge-based approach. In: ICRA, pp. 890–894 (1985)

    Google Scholar 

  6. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell. 138(1), 181–234 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Alpen-Adria Universität Klagenfurt, Klagenfurt, Austria

    Gerhard Friedrich, Melanie Frühstück, Vera Mersheeva, Anna Ryabokon & Erich Teppan

  2. Infineon Technologies Austria AG, Villach, Austria

    Maria Sander & Andreas Starzacher

Authors
  1. Gerhard Friedrich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Melanie Frühstück
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vera Mersheeva
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Anna Ryabokon
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Maria Sander
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Andreas Starzacher
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Erich Teppan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Vera Mersheeva , Andreas Starzacher or Erich Teppan .

Editor information

Editors and Affiliations

  1. Operations Research, RWTH Aachen University, Aachen, Germany

    Marco Lübbecke

  2. Lehrstuhl II für Mathematik, RWTH Aachen University, Aachen, Germany

    Arie Koster

  3. RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Peter Letmathe

  4. E.ON Energy Research Center, RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Reinhard Madlener

  5. Management Science, RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Britta Peis

  6. Chair of Operations Management, RWTH Aachen University, Aachen, Germany

    Grit Walther

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Friedrich, G. et al. (2016). Representing Production Scheduling with Constraint Answer Set Programming. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_23

Download citation

Publish with us

Policies and ethics

Search

Navigation