• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Research Online
    • Conference outputs
    • View Item
    • Home
    • Griffith Research Online
    • Conference outputs
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • Optimal Plant Layout Design based on MASS Algorithm

    Author(s)
    Khoshnevisan, Mohammad
    Bhattacharya, Sukanto
    Griffith University Author(s)
    Khoshnevisan, Mohammad
    Year published
    2003
    Metadata
    Show full item record
    Abstract
    In this paper we have proposed a semiheuristic optimization algorithm for designing optimal plant layouts in process-focused manufacturing/sem'ce facilities. OUT proposed algorithm marries the wellknown CRAFT (Computerized Relative Allocation of Facilities Technique) with the Hungarian assignment algorithm. Being a semi-heuristic search, OUT alyolithm is likely to be more eficient in tems of computer CPU engagement time as it tends to converge on the global optimum faster than the traditional CRAFT algorithm - a pure heuristic. We also present a numerical illustration of OUT algorithm. We also suggest an eztension to the ...
    View more >
    In this paper we have proposed a semiheuristic optimization algorithm for designing optimal plant layouts in process-focused manufacturing/sem'ce facilities. OUT proposed algorithm marries the wellknown CRAFT (Computerized Relative Allocation of Facilities Technique) with the Hungarian assignment algorithm. Being a semi-heuristic search, OUT alyolithm is likely to be more eficient in tems of computer CPU engagement time as it tends to converge on the global optimum faster than the traditional CRAFT algorithm - a pure heuristic. We also present a numerical illustration of OUT algorithm. We also suggest an eztension to the problem under study through the incorporation of principles of neutrasophic statistics.
    View less >
    Conference Title
    Proceedings of the Sixth International Conference of Information Fusion, 2003.Volume 2
    Publisher URI
    http://ieeexplore.ieee.org/servlet/opac?punumber=8886
    Copyright Statement
    © 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
    Subject
    Multi-Disciplinary
    Publication URI
    http://hdl.handle.net/10072/27310
    Collection
    • Conference outputs

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E
    • TEQSA: PRV12076

    Tagline

    • Gold Coast
    • Logan
    • Brisbane - Queensland, Australia
    First Peoples of Australia
    • Aboriginal
    • Torres Strait Islander