IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i9p1493-1511.html
   My bibliography  Save this article

GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence

Author

Listed:
  • Juan A. Díaz
  • Dolores E. Luna

Abstract

In this study, a hybrid heuristic is proposed for the Manufacturing Cell Formation Problem considering part processing sequence. The hybrid heuristic is based on a GRASP heuristic and then it uses a path relinking strategy on a set of elite solutions obtained by GRASP. The proposed GRASP heuristic constructs feasible solutions using a two-stage randomised greedy procedure, that are improved with a local search procedure. This procedure explores two neighbourhoods: machine reassignments and machine interchanges. The path relinking is used as an intensification strategy to improve the GRASP solutions. The performance of the proposed heuristic is evaluated with data-sets from the literature and a set of larger size instances randomly generated. The obtained results show that the GRASP heuristic provides optimal or near optimal solutions with very small computational burden. These results are further improved with a Path Relinking strategy. The most remarkable features of the proposed heuristic are its simplicity and its ease of implementation.

Suggested Citation

  • Juan A. Díaz & Dolores E. Luna, 2018. "GRASP with path relinking for the manufacturing cell formation problem considering part processing sequence," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(9), pages 1493-1511, September.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:9:p:1493-1511
    DOI: 10.1080/01605682.2017.1404183
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2017.1404183
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2017.1404183?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. Raka Jovanovic & Antonio P. Sanfilippo & Stefan Voß, 2022. "Fixed set search applied to the multi-objective minimum weighted vertex cover problem," Journal of Heuristics, Springer, vol. 28(4), pages 481-508, August.
    2. Jovanovic, Raka & Sanfilippo, Antonio P. & Voß, Stefan, 2023. "Fixed set search applied to the clique partitioning problem," European Journal of Operational Research, Elsevier, vol. 309(1), pages 65-81.

    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:tjorxx:v:69:y:2018:i:9:p:1493-1511. 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/tjor .

    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.