Research and Markets, the largest resource for market research information in world providing essential market research reports, industry research, industry analysis, forecasts, market studies, company profiles and country reports.
Welcome - Register - Login - Help/FAQ - 0 items View Basket
Worlds Largest Market Research Resource - 1516374 Live Reports
Search Research and Markets
  Search
Enter keywords, a title or
a report id number below.





Advanced   
Company search
Register for free email updates of market research
Currency
  Select a currency for use throughout the site



Viewing report

Order by Fax
Ask a Question
Printer Friendly
PDF Brochure
Hard CopyAdd to Basket
Live Chat Live Help Software for Website

Facility Layout Planning and Design. Edition No. 1

VDM Publishing House, Aug 2010, Pages: 252


  Description  
   Authors   
    
    
    
     
  Enquire before Buying   
  Send to a Friend   

The Facility Layout Problem (FLP) is a well researched problem. Locating facilities in a given space is a common problem encountered in the manufacturing industries. FLP is formulated as the Quadratic Assignment Problem (QAP) which is proved to be NP-hard. If the layout is fixed over the period of time it is referred as a Static Facility Layout Problem (SFLP) else a Dynamic facility Layout Problem (DFLP). Nowadays, the results achieved by applying the best existing exact algorithms are modest: generally instances of sizes larger than 20 can not be solved optimally in a reasonable time. Thus, the interest lies in the application of heuristic and meta-heuristic methods to solve large instances of SFLP and DFLP. This book, therefore, provides new heuristic and meta-heuristic approaches to solve SFLP and DFLP in a reasonably less computational time. Heuristics and Meta-heuristics given in the book are tested on various instances taken from literature and it is found that these heuristics provides better solution. This book should help those who are working in the layout/location problems or anyone who are working on combinatorial optimization problems.



For enquiries please call us on:
  +353-1-415-1241 (GMT Office Hours)
  1-917-300-0470 (EST Office Hours)

   All rights reserved. © Copyright 2012 Research and Markets
   Terms and conditions Privacy Policy Publishers Employment Opportunities Site Map Link to us Webmaster Affiliate Network


Research and Markets RSS Feeds