IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v13y2013i1p27-55.html
   My bibliography  Save this article

An optimal path in a bi-criteria AGV-based flexible jobshop manufacturing system having uncertain parameters

Author

Listed:
  • Hamed Fazlollahtabar
  • Nezam Mahdavi-Amiri

Abstract

We propose an approach for finding an optimal path in a flexible jobshop manufacturing system considering two criteria of time and cost. With rise in demands, advancement in technology and increase in production capacity, the need for more shops persists. Therefore, a flexible jobshop system has more than one shop with the same duty. The difference among shops with the same duty is in their machines with various specifications. A network is configured in which the nodes are considered to be the shops with arcs representing the paths among the shops. An automated guided vehicle functions as a material handling device through the manufacturing network. To account for uncertainty, we consider time to be a triangular fuzzy number and apply an expert system to infer cost. The objective is to find a path minimising both the time and cost criteria, aggregately. Since time and cost have different scales, a normalisation procedure is proposed to remove the scales. The model being biobjective, the analytical hierarchy process weighing method is applied to construct a single objective. Finally, a dynamic programming approach is presented for computing a shortest path in the network. The efficiency of the proposed approach is illustrated by a numerical example.

Suggested Citation

  • Hamed Fazlollahtabar & Nezam Mahdavi-Amiri, 2013. "An optimal path in a bi-criteria AGV-based flexible jobshop manufacturing system having uncertain parameters," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 13(1), pages 27-55.
    • Handle: RePEc:ids:ijisen:v:13:y:2013:i:1:p:27-55
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=50544
    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:ijisen:v:13:y:2013:i:1:p:27-55. 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=188 .

    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.