In this paper, a mathematical program and solution algorithm is developed for optimal robot selection and workstation assignment for a CIM system. In specific, our model considers selection of a proper mix of multiple-type robots such that operational requirements from a given number of work- stations are satisfied at minimal system cost. Each robot is characterized by its fixed charge, and subject to limits on machine time and work envelope. Each workstation has known demands on both robot machine time and work space. The model is formulated as a pure 0-1 mathematical program and is shown harder than two-dimensional bin packing, a well-known NP-hard problem. A three-phase optimization algorithm is implemented and tested by solving 450 randomly generated problems. Computational results indicate the solution algorithm is effective in solving problems of a practical size (i.e., 50 workstations and a maximum of 20 robots) within acceptable computational times. >
['Jack S. Cook', 'Bernard T. Han']
Optimal robot selection and workstation assignment for a CIM system