IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v105y1998i3p537-551.html
   My bibliography  Save this article

An optimal tree search method for the manufacturing systems cell formation problem

Author

Listed:
  • Spiliopoulos, K.
  • Sofianopoulou, S.

Abstract

No abstract is available for this item.

Suggested Citation

  • Spiliopoulos, K. & Sofianopoulou, S., 1998. "An optimal tree search method for the manufacturing systems cell formation problem," European Journal of Operational Research, Elsevier, vol. 105(3), pages 537-551, March.
    • Handle: RePEc:eee:ejores:v:105:y:1998:i:3:p:537-551
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00078-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Paolo Carraresi & Federico Malucelli, 1992. "A New Lower Bound for the Quadratic Assignment Problem," Operations Research, INFORMS, vol. 40(1-supplem), pages 22-27, February.
    2. Ravi Kumar, K. & Kusiak, Andrew & Vannelli, Anthony, 1986. "Grouping of parts and components in flexible manufacturing systems," European Journal of Operational Research, Elsevier, vol. 24(3), pages 387-397, March.
    3. Cheng, Ch, 1992. "Algorithms for grouping machine groups in group technology," Omega, Elsevier, vol. 20(4), pages 493-501, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. de Meijer, Frank, 2023. "Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization," Other publications TiSEM b1f1088c-95fe-4b8a-9e15-c, Tilburg University, School of Economics and Management.
    2. Mohamed, Zubair M. & Kumar, Ashok & Motwani, Jaideep, 1999. "An improved part grouping model for minimizing makespan in FMS," European Journal of Operational Research, Elsevier, vol. 116(1), pages 171-182, July.
    3. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
    4. Vittorio Maniezzo, 1999. "Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 358-369, November.
    5. Stawowy, Adam, 2006. "Evolutionary strategy for manufacturing cell design," Omega, Elsevier, vol. 34(1), pages 1-18, January.
    6. Logendran, Rasaratnam & Talkington, Diane, 1997. "Analysis of cellular and functional manufacturing systems in the presence of machine breakdown," International Journal of Production Economics, Elsevier, vol. 53(3), pages 239-256, December.
    7. Kulkarni, Uday R. & Kiang, Melody Y., 1995. "Dynamic grouping of parts in flexible manufacturing systems -- a self-organizing neural networks approach," European Journal of Operational Research, Elsevier, vol. 84(1), pages 192-212, July.
    8. Frank Meijer & Renata Sotirov, 2020. "The quadratic cycle cover problem: special cases and efficient bounds," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 1096-1128, May.
    9. John G. Klincewicz & Arvind Rajan, 1994. "Using grasp to solve the component grouping problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(7), pages 893-912, December.
    10. Nair, G. Jayakrishnan & Narendran, T. T., 1997. "Cluster goodness: A new measure of performance for cluster formation in the design of cellular manufacturing systems," International Journal of Production Economics, Elsevier, vol. 48(1), pages 49-61, January.
    11. Wu, Tai-Hsi & Chang, Chin-Chih & Yeh, Jinn-Yi, 2009. "A hybrid heuristic algorithm adopting both Boltzmann function and mutation operator for manufacturing cell formation problems," International Journal of Production Economics, Elsevier, vol. 120(2), pages 669-688, August.
    12. Juan Díaz & Dolores Luna & Ricardo Luna, 2012. "A GRASP heuristic for the manufacturing cell formation problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(3), pages 679-706, October.
    13. Ben-Arieh, David & Sreenivasan, Ravi, 1999. "Information analysis in a distributed dynamic group technology method," International Journal of Production Economics, Elsevier, vol. 60(1), pages 427-432, April.
    14. Wu, Tai-Hsi & Chung, Shu-Hsing & Chang, Chin-Chih, 2010. "A water flow-like algorithm for manufacturing cell formation problems," European Journal of Operational Research, Elsevier, vol. 205(2), pages 346-360, September.
    15. Berna H. Ulutas, 2019. "An immune system based algorithm for cell formation problem," Journal of Intelligent Manufacturing, Springer, vol. 30(8), pages 2835-2852, December.
    16. Boutsinas, Basilis, 2013. "Machine-part cell formation using biclustering," European Journal of Operational Research, Elsevier, vol. 230(3), pages 563-572.
    17. Rostami, Borzou & Chassein, André & Hopf, Michael & Frey, Davide & Buchheim, Christoph & Malucelli, Federico & Goerigk, Marc, 2018. "The quadratic shortest path problem: complexity, approximability, and solution methods," European Journal of Operational Research, Elsevier, vol. 268(2), pages 473-485.
    18. Hassan, Mohsen M. D., 1995. "Layout design in group technology manufacturing," International Journal of Production Economics, Elsevier, vol. 38(2-3), pages 173-188, March.
    19. Mans, Bernard & Mautor, Thierry & Roucairol, Catherine, 1995. "A parallel depth first search branch and bound algorithm for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 81(3), pages 617-628, March.
    20. Ball, Michael O. & Kaku, Bharat K. & Vakhutinsky, Andrew, 1998. "Network-based formulations of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 241-249, January.

    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:eee:ejores:v:105:y:1998:i:3:p:537-551. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.