Optimal robot selection and workstation assignment for a CIM system

Author

Cook, Jack S. ; Han, Bernard T.

Author_Institution

Jones Sch. of Bus., State Univ. of New York, Genesco, NY, USA

Volume

10

Issue

2

fYear

1994

fDate

4/1/1994 12:00:00 AM

Firstpage

210

Lastpage

219

Abstract

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

Keywords

computational complexity; computer integrated manufacturing; industrial robots; mathematical programming; production control; 0-1 mathematical program; CIM; NP-hard problem; machine time; operational requirements; production control; robot selection; three phase optimization; work envelope; workstation assignment; Computer integrated manufacturing; Costs; Lifting equipment; Mathematical model; NP-hard problem; Orbital robotics; Robots; Space stations; Space technology; Workstations;

fLanguage

English

Journal_Title

Robotics and Automation, IEEE Transactions on

Publisher

ieee

ISSN

1042-296X

Type

jour

DOI

10.1109/70.282545

Filename

282545