首页 | 本学科首页   官方微博 | 高级检索  
     


DESIGNING CELLULAR MANUFACTURING SYSTEMS: BRANCH-AND-BOUND AND A* APPROACHES
Authors:Andrew Kusiak  Warren J Boe  Chunhung Cheng
Affiliation:  a Department of Industrial Engineering, The University of Iowa, Iowa City, IA b Department of Management Sciences, The University of Iowa, Iowa City, IA
Abstract:In this paper, heuristic and optimal algorithms for solving the group technology problem are presented. The heuristic algorithm is based on a branch-and-bound concept. A quadratic programming model for the machine grouping problem is formulated. The A* algorithm is developed for optimal solving of the machine grouping problem. The performance of the heuristic branch-and-bound method and the A* algorithm is compared with several existing heuristics.
Keywords:
本文献已被 InformaWorld 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号