IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v201y2024i1d10.1007_s10957-024-02388-4.html
   My bibliography  Save this article

Compatible TOSets with POSets: An Application to Additive Manufacturing

Author

Listed:
  • Policarpo Abascal

    (Universidad de Oviedo)

  • Fernando Fueyo

    (Universidad de Oviedo)

  • Jorge Jiménez

    (Universidad de Oviedo)

  • Antonio Palacio

    (Universidad de Oviedo)

  • Maria Luisa Serrano

    (Universidad de Oviedo)

Abstract

Additive manufacturing (AM) has become a widely used technique in 3D printing, but it has proven to be a very costly process, even when optimizing parameters in existing models. Due to the characteristics of AM, and in order to optimize its process, a new approach is introduced to the problem: the discretization of each layer to be printed. This involves establishing an order relation based on the sequence in which the layers should be printed. The valid orders for the execution of the process, referred to as compatible with the order relation, will be characterized. Additionally, algorithms will be provided to obtain new compatible orders from others that were already compatible, and strategies will be presented to optimally and efficiently reorder non-compatible orders, converting them into compatible ones.

Suggested Citation

  • Policarpo Abascal & Fernando Fueyo & Jorge Jiménez & Antonio Palacio & Maria Luisa Serrano, 2024. "Compatible TOSets with POSets: An Application to Additive Manufacturing," Journal of Optimization Theory and Applications, Springer, vol. 201(1), pages 177-198, April.
    • Handle: RePEc:spr:joptap:v:201:y:2024:i:1:d:10.1007_s10957-024-02388-4
    DOI: 10.1007/s10957-024-02388-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-024-02388-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-024-02388-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Nathalie Caspard & Bruno Leclerc & Bernard Monjardet, 2012. "Finite Ordered Sets Concepts, Results and Uses," Post-Print halshs-00800193, HAL.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. repec:hal:pseose:halshs-00977005 is not listed on IDEAS
    2. Ulrich Faigle & Michel Grabisch & Andres Jiménez-Losada & Manuel Ordóñez, 2014. "Games on concept lattices: Shapley value and core," Documents de travail du Centre d'Economie de la Sorbonne 14070, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    3. Michel Grabisch & Agnieszka Rusinowska, 2015. "Lattices in Social Networks with Influence," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 17(01), pages 1-18.
    4. Olivier Hudry, 2015. "Complexity results for extensions of median orders to different types of remoteness," Annals of Operations Research, Springer, vol. 225(1), pages 111-123, February.
    5. Denis Bouyssou & Marc Pirlot, 2020. "Unit representation of semiorders I: Countable sets," Working Papers hal-02918005, HAL.
    6. Denis Bouyssou & Thierry Marchant & Marc Pirlot, 2020. "A theoretical look at ELECTRE TRI-nB," Working Papers hal-02917994, HAL.
    7. Denis Bouyssou & Thierry Marchant & Marc Pirlot, 2020. "A theoretical look at ELECTRE TRI-nB," Working Papers hal-02898131, HAL.
    8. Denis Bouyssou & Thierry Marchant & Marc Pirlot, 2023. "A theoretical look at Electre Tri-nB and related sorting models," 4OR, Springer, vol. 21(1), pages 1-31, March.
    9. repec:hal:pseose:hal-01111670 is not listed on IDEAS
    10. Salii, Yaroslav, 2019. "Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization," European Journal of Operational Research, Elsevier, vol. 272(1), pages 32-42.

    More about this item

    Keywords

    Order relations; POSets; TOSets;
    All these keywords.

    Statistics

    Access and download statistics

    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:joptap:v:201:y:2024:i:1:d:10.1007_s10957-024-02388-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.