IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-28697-6_23.html
   My bibliography  Save this book chapter

Representing Production Scheduling with Constraint Answer Set Programming

In: Operations Research Proceedings 2014

Author

Listed:
  • Gerhard Friedrich

    (Alpen-Adria Universität Klagenfurt)

  • Melanie Frühstück

    (Alpen-Adria Universität Klagenfurt)

  • Vera Mersheeva

    (Alpen-Adria Universität Klagenfurt)

  • Anna Ryabokon

    (Alpen-Adria Universität Klagenfurt)

  • Maria Sander

    (Infineon Technologies Austria AG)

  • Andreas Starzacher

    (Infineon Technologies Austria AG)

  • Erich Teppan

    (Alpen-Adria Universität Klagenfurt)

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.

Suggested Citation

  • Gerhard Friedrich & Melanie Frühstück & Vera Mersheeva & Anna Ryabokon & Maria Sander & Andreas Starzacher & Erich Teppan, 2016. "Representing Production Scheduling with Constraint Answer Set Programming," Operations Research Proceedings, in: Marco Lübbecke & Arie Koster & Peter Letmathe & Reinhard Madlener & Britta Peis & Grit Walther (ed.), Operations Research Proceedings 2014, edition 1, pages 159-165, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-28697-6_23
    DOI: 10.1007/978-3-319-28697-6_23
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-28697-6_23. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.