IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v54y2016i3p778-798.html
   My bibliography  Save this article

A new approach for loop machine layout problem integrating proximity constraints

Author

Listed:
  • G. Manita
  • I. Chaieb
  • O. Korbaa

Abstract

This paper focuses on the machine arrangement problem on common loop network in a flexible manufacturing system. Existing studies aim to place machines at pre-fixed positions around a loop network. This problem is considered as a permutation problem that aims to find the best combination to reduce generated costs. In this work, we try to add more complexity to this problem by respecting the proximity constraints, defined by the experts, between the machines. To do this, we propose an algorithm based on direct distance measure. Logically, proximity constraints are checked using direct distances but costs are calculated using travelled distances. Throughout this study, we seek the best machine layout in four transport system configuration types to minimise the sum of flow time distances. Comparing our algorithm results with two hybrid genetic algorithms, the empirical results show that the proposed algorithm provides the most suitable solutions.

Suggested Citation

  • G. Manita & I. Chaieb & O. Korbaa, 2016. "A new approach for loop machine layout problem integrating proximity constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 778-798, February.
    • Handle: RePEc:taf:tprsxx:v:54:y:2016:i:3:p:778-798
    DOI: 10.1080/00207543.2015.1064178
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2015.1064178
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2015.1064178?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.

    Citations

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


    Cited by:

    1. Gintaras Palubeckis, 2020. "An Approach Integrating Simulated Annealing and Variable Neighborhood Search for the Bidirectional Loop Layout Problem," Mathematics, MDPI, vol. 9(1), pages 1-30, December.

    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:tprsxx:v:54:y:2016:i:3:p:778-798. 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/TPRS20 .

    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.