Approximate Algorithm For Group Technology Line Formation Problem(ABSTRACTS OF PROCEEDINGS OF THE SCHOOL OF INFORMATION TECHNOLOGY AND ELECTRONICS SERIES J TOKAI UNIVERSITY -2003-2004-)

概要

論文の詳細を見る
The line that processes two or more parts to which the operation sequence is similar is called the Group Technology (GT) line. When the introduction of the GT line is planned, it is necessary to consider the volume of materials handling in the processing line and the required number of machines arranged in the processing line. That is, when the object parts are devided into some parts-families based on the similarity of the operation sequence and a processing line is prepared per a parts-family, the more the devided number of parts-families is increasing, the more the volume of materials handling in the processing line is decreasing, in general. However, the required number of machines that should be arranged in the processing line increases oppositely, when the divided number of parts-families is increased. Therefore, when the introduction of the GT line is planned, the problem arises in how many lines of what kind of machines arranged can be minimized the volume of materials handling in the processing line, under the condition below the given number of machines. In this study, we call this problem GT line Formation Problem, and proposes an approximate algorithm of this problem.
東海大学の論文