IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v47y2018i15p3547-3570.html
   My bibliography  Save this article

A robust posterior preference multi-response optimization approach in multistage processes

Author

Listed:
  • Amir Moslemi
  • Mirmehdi Seyyed-Esfahani
  • Seyed Taghi Akhavan Niaki

Abstract

Nowadays, many manufacturing and service systems provide products and services to their customers in several consecutive stages of operations, in each of which one or more quality characteristics of interest are monitored. In these environments, the final quality in the last stage not only depends on the quality of the task performed in that stage but also is dependent on the quality of the products and services in intermediate stages as well as the design parameters in each stage. In this paper, a novel methodology based on the posterior preference approach is proposed to robustly optimize these multistage processes. In this methodology, a multi-response surface optimization problem is solved in order to find preferred solutions among different non dominated solutions (NDSs) according to decision maker's preference. In addition, as the intermediate response variables (quality characteristics) may act as covariates in the next stages, a robust multi-response estimation method is applied to extract the relationships between the outputs and inputs of each stage. NDSs are generated by the ϵ-constraint method. The robust preferred solutions are selected considering some newly defined conformance criteria. The applicability of the proposed approach is illustrated by a numerical example at the end.

Suggested Citation

  • Amir Moslemi & Mirmehdi Seyyed-Esfahani & Seyed Taghi Akhavan Niaki, 2018. "A robust posterior preference multi-response optimization approach in multistage processes," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 47(15), pages 3547-3570, August.
  • Handle: RePEc:taf:lstaxx:v:47:y:2018:i:15:p:3547-3570
    DOI: 10.1080/03610926.2017.1359301
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2017.1359301
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2017.1359301?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.

    More about this item

    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:taf:lstaxx:v:47:y:2018:i:15:p:3547-3570. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.