IDEAS home Printed from https://ideas.repec.org/a/ids/injams/v7y2015i3p194-222.html
   My bibliography  Save this article

A desirability function-based approach for optimising generalised queuing networks

Author

Listed:
  • Yahya Zare Mehrjerdi
  • Amin Yazdekhasti
  • Ali Salmasnia
  • Hadi Mokhtari

Abstract

The analysis and optimisation of queuing networks (QNs) has received increasing attention over the last few years in many manufacturing and service systems such as information technology, transportation, supply chain and traffic control. Robustness is another important concept which refers to the low sensitivity of objective functions to uncontrollable (noise) variables. Most of the existing research works in literature are unable to deal with multi-objective optimisation of queuing networks and ignore robustness of objective functions. In this paper an interactive robust multi-objective optimisation approach based on desirability function is presented to optimise performance of generalised queuing networks (GQNs). The proposed approach includes computational and decision making phases. The computational phase consists of employing a proper design of experiment and response surface methodology to obtain a primarily design of GQNs. In the second phase, decision maker after evaluating current solution either accepts it or by resetting parameters tries toward optimal design according to his/her preferences. To illustrate the applicability of the suggested approach, a computational analysis is performed on a pizza shop system.

Suggested Citation

  • Yahya Zare Mehrjerdi & Amin Yazdekhasti & Ali Salmasnia & Hadi Mokhtari, 2015. "A desirability function-based approach for optimising generalised queuing networks," International Journal of Applied Management Science, Inderscience Enterprises Ltd, vol. 7(3), pages 194-222.
  • Handle: RePEc:ids:injams:v:7:y:2015:i:3:p:194-222
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=71145
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:injams:v:7:y:2015:i:3:p:194-222. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=286 .

    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.