A procedure for selecting optimal set of processors under time constraints

Author

Awoniyi, Samuel ; Khajenoori, Soheil

Author_Institution

Florida State Univ. Coll. of Eng., Tallahassee, FL, USA

fYear

1989

fDate

26-28 Mar 1989

Firstpage

231

Lastpage

233

Abstract

A decomposition heuristic is presented for the problem of selecting a minimum-cost set of processors that can complete a given set of tasks within a given period of time. This problem, which belongs to the NP-complete class of optimization problems, is encountered in designing manufacturing systems consisting mainly of robots and other programmable manipulators. There are two parts to the heuristic. The main part is a decomposition procedure that goes back and forth between two subproblems, one a transportation problem and the other a critical-path problem. The other part is a special set-covering procedure. Computational results are reported

Keywords

computational complexity; equipment selection (computers); industrial robots; manufacturing computer control; optimisation; NP-complete; critical-path problem; decomposition heuristic; manufacturing computer control; manufacturing systems; optimization; processor set selection; programmable manipulators; robots; set-covering procedure; time constraints; Costs; Educational institutions; Humans; Manipulators; Manufacturing; Production; Robotic assembly; Service robots; Time factors; Transportation;

fLanguage

English

Publisher

ieee

Conference_Titel

System Theory, 1989. Proceedings., Twenty-First Southeastern Symposium on

Conference_Location

Tallahassee, FL

ISSN

0094-2898

Print_ISBN

0-8186-1933-3

Type

conf

DOI

10.1109/SSST.1989.72467

Filename

72467