IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i5d10.1057_palgrave.jors.2600704.html
   My bibliography  Save this article

A one-step tabu search algorithm for manufacturing cell design

Author

Listed:
  • S Lozano

    (Universidad de Sevilla)

  • B Adenso-Díaz

    (Universidad de Oviedo)

  • I Eguia

    (Universidad de Sevilla)

  • L Onieva

    (Universidad de Sevilla)

Abstract

As part of the cellular manufacturing design process, machines must be grouped in cells and the corresponding part families must be assigned. Limits on both the number of machines per cell and the number of parts per family can be considered. A weighted sum of intracell voids and intercellular moves is used to evaluate the quality of the solutions. We present a tabu search algorithm that systematically explores feasible machine cells configurations determining the corresponding part families using a linear network flow model. The performance of this tabu search is benchmarked against two simulated annealing approaches, another tabu search approach and three heuristics: (ZODIAC, GRAFICS and MST).

Suggested Citation

  • S Lozano & B Adenso-Díaz & I Eguia & L Onieva, 1999. "A one-step tabu search algorithm for manufacturing cell design," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(5), pages 509-516, May.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:5:d:10.1057_palgrave.jors.2600704
    DOI: 10.1057/palgrave.jors.2600704
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600704
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600704?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. Sheu Chen, 2010. "A Heuristic Algorithm for Hierarchical Hub-and-spoke Network of Time-definite Common Carrier Operation Planning Problem," Networks and Spatial Economics, Springer, vol. 10(4), pages 509-523, December.
    2. Boutsinas, Basilis, 2013. "Machine-part cell formation using biclustering," European Journal of Operational Research, Elsevier, vol. 230(3), pages 563-572.
    3. Yin, Yong & Yasuda, Kazuhiko, 2006. "Similarity coefficient methods applied to the cell formation problem: A taxonomy and review," International Journal of Production Economics, Elsevier, vol. 101(2), pages 329-352, June.
    4. Papaioannou, Grammatoula & Wilson, John M., 2010. "The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research," European Journal of Operational Research, Elsevier, vol. 206(3), pages 509-521, November.
    5. R Torres-Velázquez & V Estivill-Castro, 2004. "Local search for Hamiltonian Path with applications to clustering visitation paths," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 737-748, July.
    6. Ricardo Soto & Broderick Crawford & Rodrigo Olivares & César Carrasco & Eduardo Rodriguez-Tello & Carlos Castro & Fernando Paredes & Hanns de la Fuente-Mella, 2020. "A Reactive Population Approach on the Dolphin Echolocation Algorithm for Solving Cell Manufacturing Systems," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
    7. Jose Joaquin del Pozo-Antúnez & Francisco Fernández-Navarro & Horacio Molina-Sánchez & Antonio Ariza-Montes & Mariano Carbonero-Ruz, 2021. "The Machine-Part Cell Formation Problem with Non-Binary Values: A MILP Model and a Case of Study in the Accounting Profession," Mathematics, MDPI, vol. 9(15), pages 1-16, July.
    8. Belarmino Adenso-Díaz & Manuel Laguna, 2006. "Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search," Operations Research, INFORMS, vol. 54(1), pages 99-114, February.

    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:pal:jorsoc:v:50:y:1999:i:5:d:10.1057_palgrave.jors.2600704. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.