Metaheuristics for a Flexible Assembly System Design Problem |
| |
| Authors: | Sheldon H Jacobson Alan W Johnson Kelly A Sullivan Mark A Fleischer Ashok Kumar |
| |
| Institution: | (1) Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, 24061-0118;(2) Graduate School of Systems and Logistics, Air Force Institute of Technology, Wright-Patterson AFB, Dayton, OH, 45433-7765;(3) Department of Engineering Management, Old Dominion University, Norfolk, VA, 23529-0248;(4) Seidman School of Business, Grand Valley State University, 510 Eberhard Center, Grand Rapids, MI, 49504 |
| |
| Abstract: | Flexibility has become an important priority in the formulation and implementation of manufacturing strategies. This in turn has opened up a new class of design problems for such systems. Flexible assembly systems (FAS), consisting of a variety of processors and operations, provide the opportunity for improving product manufacturing flexibility, hence gaining competitive advantages. This paper considers a particular design decision problem for FAS. A matrix-based, polynomial-time lower bound algorithm is presented. Simulated annealing and tabu search metaheuristics are formulated to address the problems. Computational experience with these metaheuristics is reported. |
| |
| Keywords: | flexible assembly systems tabu search simulated annealing |
| 本文献已被 SpringerLink 等数据库收录！ |
|
