{"title":"Selection of process plans in automated manufacturing systems","authors":"A. Kusiak, G. Finke","doi":"10.1109/56.803","DOIUrl":null,"url":null,"abstract":"Most of the planning models for automated manufacturing systems are based on the assumption that for each part there is only one process plan available. A more realistic point of view is taken that for each part a number of different process plans are generated, each of which may require specific types of tools and auxiliary devices such as fixtures, grippers, and feeders. A model for the selection of a set of process plans with the minimum corresponding manufacturing cost and minimal number of tools and auxiliary devices is formulated. The developed model for m parts is equivalent to the problem of finding the maximum clique in an m-partite graph with the minimum corresponding cost. Heuristic algorithms and numerical results are discussed. >","PeriodicalId":370047,"journal":{"name":"IEEE J. Robotics Autom.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"64","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE J. Robotics Autom.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/56.803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 64
Abstract
Most of the planning models for automated manufacturing systems are based on the assumption that for each part there is only one process plan available. A more realistic point of view is taken that for each part a number of different process plans are generated, each of which may require specific types of tools and auxiliary devices such as fixtures, grippers, and feeders. A model for the selection of a set of process plans with the minimum corresponding manufacturing cost and minimal number of tools and auxiliary devices is formulated. The developed model for m parts is equivalent to the problem of finding the maximum clique in an m-partite graph with the minimum corresponding cost. Heuristic algorithms and numerical results are discussed. >